#include <bits/stdc++.h>

using namespace std;

ifstream fin ("livada.in");

ofstream fout ("livada.out");

int n, m, p, a[700005];

int Elmaj()

{

    int cand, s;

    cand = a[1];
    s = 1;

    for(int i = 2 ; i <= m ; i++)
    {

        if(cand != a[i])

            s--;

        else s++;

        if(s == 0)

        {

            cand = a[i];

            s = 1;

        }

    }

    s = 0;

    for(int i = 1 ; i <= m ; i++)

        if(a[i] == cand)
            s++;

    if(s > m / 2)

        return 1;

    return 0;

}

int Secv_Elem_Cons()

{

    int s, lgmax;

    s = lgmax = 1;
    for(int i = 2 ; i <= m ; i++)

    {

        if(a[i] == a[i - 1])

            s++;

        else
            s = 1;

        lgmax = max(lgmax, s);

    }

    return lgmax;

}

int main()

{

    int lgmax,nr = 0;

    fin >> n >> m >> p;
    lgmax = 0;
    for(int i = 1 ; i <= n ; i++)
    {

        for(int j = 1 ; j <= m ; j++)

            fin >> a[j];
        if(Elmaj())

            nr++;

        lgmax = max(lgmax, Secv_Elem_Cons());

    }

    fout << nr << "\n" << lgmax << "\n";



}