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

ll N, M, P;
ll t[100005];

int main()
{
    cin >> N >> M >> P;

    int ans1=0, ans2=0;

    for(int i = 0; i < N; i++)
    {
        for(int j = 0; j < M;j++)
            cin >> t[j];

        //1. subtask
        map<ll, int> m;
        for(int j = 0;j < M; j++)
            m[t[j]]++;
        int mDb=0;
        for(auto aktErt:m)
        {
            mDb = max(mDb, aktErt.second);
        }
        if(mDb>M-mDb)
            ans1++;

        //2. subtask
        int aktDb=1;
        for(int j = 1;j <= M; j++)
        {
            if(t[j-1]==t[j])
                aktDb++;
            else
            {
                ans2 = max(ans2, aktDb);
                aktDb=1;
            }
        }
    }



    cout << ans1 << "\n";
    cout << ans2 << "\n";
    return 0;
}