#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,p,i,maxl,maxt,j,V[700001],nr,maxc;
void solve();
int main()
{
	solve();
	return 0;
}
void solve()
{
	freopen("livada1.in","r",stdin);
	freopen("livada1.out","w",stdout);
	
	scanf("%d%d%d",&n,&m,&p);
	V[0]=-1;
	for(i=1;i<=n;i++)
	{
		maxt=0;
		for(j=1;j<=m;j++)
		{
			scanf("%d",&V[j]);
			if(V[j]==V[j-1]) maxt++;
			else maxl=(maxt>maxl?maxt:maxl),maxt=1;
		}
		maxl=(maxt>maxl?maxt:maxl);
		
		sort(V+1,V+m+1);
		maxc=0;maxt=0;
		for(j=1;j<=m;j++)
			if(V[j]==V[j-1]) maxt++;
			else maxc=(maxt>maxc?maxt:maxc),maxt=1;
		maxc=(maxt>maxc?maxt:maxc);
		if(maxc>=m/2+1) nr++;
	}
	printf("%d\n%d\n",nr,maxl);
}