//Coded by Chirath Nirodha
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define I insert
#define P push
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_tree;
const ll mod=1e9+7;
inline void io(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve(){
io();
int n,t,p;cin>>n>>t>>p;p--;
bool arr[n][t];
for(int i=0;i<n;i++)for(int j=0;j<t;j++)cin>>arr[i][j];
ll points[t];
for(int j=0;j<t;j++){
points[j]=0;
for(int i=0;i<n;i++)if(!arr[i][j])points[j]++;
}
vector<pair<int,int> > rank;
for(int i=0;i<n;i++){
ll x=0;
for(int j=0;j<t;j++)if(arr[i][j])x+=points[j];
rank.PB(MP(x,i));
}
sort(rank.begin(),rank.end());
if(rank[n-1].S==p){cout<<rank[n-1].F<<" "<<1<<endl;return;}
int cur=1;
for(int i=n-2;i>=0;i--){
if(rank[i].F!=rank[i+1].F)cur=n-i;
if(rank[i].S==p){cout<<rank[i].F<<" "<<cur<<endl;return;}
}
}
int main(){
io();
solve();
}
