#include <bits/stdc++.h>
#define ll long long
#define inf INT_MAX
#define endl '\n'
using namespace std;
const int mxn = 20;
struct Person{
int point = 0, num_of_solved = 0, indx = 0;
bool operator <(Person &a){
if(a.point == this->point && a.num_of_solved == this->num_of_solved)return a.indx < this->indx;
else if(a.point == this->point)return a.num_of_solved > this->num_of_solved;
return a.point > this->point;
}
};
void solve(){
int n, t, p;
cin>>n>>t>>p;
int v[n+1][t+1];
for(int i = 1;i <= n;i++){
for(int j = 1;j <= t;j++){
cin>>v[i][j];
}
}
vector<int>point_for_each_task(t + 1);
for(int i = 1;i <= t;i++){
for(int j = 1;j <= n;j++){
point_for_each_task[i] += (v[j][i] == 0);
}
}
vector<Person>people(n);
for(int i = 1;i <= n;i++){
for(int j = 1;j <= t;j++){
if(v[i][j])people[i - 1].point += point_for_each_task[j];
people[i - 1].num_of_solved += (v[i][j] == 1);
}
people[i - 1].indx = i;
}
sort(people.begin(), people.end());
for(int i = 0;i < n;++i){
if(people[i].indx == p){
cout<<people[i].point<<" "<<i + 1;
return;
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
//cin>>t;
while(t--) solve();
}
