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

signed main() 
{
  int n,m,p;cin>>n>>m>>p;
  int ans1=0,ans2=0;
  vector<vector<int>> v(n,vector<int>(m));
  for(int i = 0;i<n;i++){
    int currn=-1,currl=0,best=0;
    map<int,int> ma;
    for(int j = 0;j<m;j++){
      cin>>v[i][j];
      ma[v[i][j]]++;
      if(v[i][j]==currn)currl++;
      else{
        currn=v[i][j];
        best=max(best,currl);
        currl=1;
      }
    }

    //task 1:
    int temp=0;
    for(auto k:ma){
      temp=max(temp,k.second);
    }
    if(temp>m/2)ans1++;
    ans2=max(ans2,best);
  }  
  cout<<ans1<<endl<<ans2;
}