#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long n, t, p;
cin >> n >> t >> p;
vector<long long> score(t, n);
vector<pair<long long, pair<long long, long long>>> res(n);
for (long long i = 0; i < n; i++) {
res[i].second.second = i;
}
vector<vector<long long>> solved(n, vector<long long>(t));
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < t; j++) {
cin >> solved[i][j];
score[j] -= solved[i][j];
res[i].second.first += solved[i][j];
}
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < t; j++) {
res[i].first += score[j] * solved[i][j];
}
}
sort(res.begin(), res.end(), [&](const pair<long long, pair<long long, long long>>& a, const pair<long long, pair<long long, long long>>& b) {
return (a.first == b.first ? (a.second.first == b.second.first ? a.second.second < b.second.second : a.second.first > b.second.first) : a.first > b.first);
});
long long rank = 1;
for (long long i = 0; i < n; i++) {
if (res[i].second.second == p - 1) {
rank = i + 1;
break;
}
}
cout << res[rank - 1].first << " " << rank << '\n';
return 0;
}
