#include <bits/stdc++.h>
using namespace std;

int egyforma(int n, vector <int> v){
    int ret = 0, cur = 0, prev = -1;
    for(int j = 0;j < n;j++){
        if(v[j] == prev){
            cur++;
        }else{
            cur = 1;
            prev = v[j];
        }
        ret = max(ret,cur);
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
	int m,n,p;cin >> m >> n >> p;
    vector<int>szinek(n);
    bool before = false;int cnt = 0,ans = 1,current = 0,prev = -1;
    for(int i = 1;i <= m;i++){
        for (int i = 0;i<n;i++) cin >> szinek[i];
        ans =max(egyforma(n,szinek),ans);
        sort(szinek.begin(),szinek.end());
        if(egyforma(n,szinek)> n/2) cnt++;
    }
    cout <<cnt<<"\n"<<ans;
}