#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,l,r) for(int i=(l); i<(r); i++)
#define all(x) x.begin(),x.end()
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N,T,P;
cin>>N>>T>>P;
vector<vector<ll>> solved(N,vector<ll>(T));
vector<ll> score(T);
rep(i,N){
rep(j,T){
cin>>solved[i][j];
if(!solved[i][j]){
score[j]++;
}
}
}
vector<pair<ll,ll>> srt(N);
rep(i,N){
srt[i].second=i;
rep(j,T){
if(solved[i][j]){
srt[i].first+=score[j];
}
}
}
sort(all(srt));
rep(i,N){
if(srt[i].second==P-1){
cout<<srt[i].first<<" "<<i+1<<"\n";
return 0;
}
}
}
