#include <bits/stdc++.h>

using namespace std;

int main()
{
    int m, n, p;
    cin >> m >> n >> p;

    int maxi = 0;
    int valasz = 0;

    for(int i = 0; i < m; i++){
        map<int, int> db;
        int legN = 0;
        int most = 1;
        int a;
        cin >> a;
        db[a]++;
        int elozo = a;
        int elso = 1;

        for(int i = 1; i < n; i++){
            int akt;
            cin >> akt;

            if(akt == elozo){
                most++;
            } else{
                legN = max(legN, most);
                most = 1;
            }
            elozo = akt;

            db[akt]++;
            elso = max(elso, db[akt]);
        }

        legN = max(legN, most);

        maxi = max(maxi, legN);
        valasz += (elso > n - elso);
    }

    cout << valasz << "\n" << maxi << "\n";
}