#include <cstdio>
#include <iostream>
using namespace std;

int main()
{
	unsigned m,contor2;
	unsigned long n,i,j,p,k,contor,next,nextmax,max;
		

	FILE *intrare,*iesire;
	intrare=fopen("livada.in","r");
	fscanf(intrare,"%d %ld %ld \n",&m,&n,&p);
	unsigned long livada[m][n];

	
	for(i=0;i<m;i++) 
		for(j=0;j<n;j++) 
		{
			fscanf(intrare,"%ld ",&livada[i][j]);
		}
		
	fclose(intrare);
	contor2=0;
	contor=0;
	max=0;
	next=1;
	nextmax=0;
	
	for(i=0;i<m;i++) 
	{
		
		for(j=0;j<n;j++)
		{
			for(k=0;k<n;k++)
				if(livada[i][j]==livada[i][k]) contor=contor+1;
			if(contor>max) max=contor;
			contor=0;	
			// partea a doua :)
			
			for(k=j+1;k<n;k++)
			{
				if(livada[i][j]==livada[i][k]) next++;
				else break;
			}
			if(nextmax<next) nextmax=next;
			next=1;
			
		}
		if(max>=(n/2)+1) contor2=contor2+1;
		max=0;
		
	}
	iesire=fopen("livada.out","w");
	fprintf(iesire,"%d\n%ld",contor2,nextmax);
	fclose(iesire);
	return 0;
}