#include <bits/stdc++.h>
using namespace std;
bool comp(array<int, 3> a, array<int, 3> b) {
if (a[0] == b[0]) {
if (a[1] == b[1]) return a[2] < b[2];
return a[1] > b[1];
}
return a[0] > b[0];
}
int main() {
int n, t, p;
cin >> n >> t >> p;
vector<int> points(t, n);
vector<array<int, 3>> v(n);
vector<vector<int>> a(n, vector<int>(t));
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) {
int x;
cin >> x;
points[j] -= x;
v[i][1] += x;
a[i][j] = x;
v[i][2] = i;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < t; j++) v[i][0] += points[j]*a[i][j];
}
sort(v.begin(), v.end(), comp);
for (int i = 0; i < n; i++) {
if (v[i][2] == p-1) {
cout << v[i][0] << ' ' << i+1 << '\n';
return 0;
}
}
return 0;
}
