#include<bits/stdc++.h>
using namespace std;
const int maxn = 2005;
int n, t, p;
int A[maxn][maxn], W[maxn], sum[maxn], usum[maxn];
int main() {
cin >> n >> t >> p;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= t; j++){
cin >> A[i][j];
W[j] += !A[i][j];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= t; j++){
sum[i] += W[j]*A[i][j];
usum[i] += A[i][j];
}
}
int re = 1;
for(int i = 1; i <= n; i++){
if(i == p)continue;
if(sum[i] != sum[p])re += sum[i] > sum[p];
else if(usum[i] != usum[p])re += usum[i] > usum[p];
else re += i < p;
}
cout << sum[p] << " " << re;
}
