#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
	int M, N, P, cnt = 0, mx = 0; cin >> M >> N >> P;
    vector<int>v(N);
    for(int k = 0; k < M; k++)
    {
        unordered_map<int, int>mp;
        for(int i = 0; i < N; i++)
        {
            cin >> v[i];
            mp[v[i]]++;
        }
        for(auto [_, i] : mp)
        {
            if(i > N - i)
            {
                cnt++;
                break;
            }
        }
        int l = 0, r = 0;
        while(r < N-1)
        {
            if(v[r] != v[r + 1])
            {
                l = r + 1;
                r++;
            }
            else
            {
                r++;
                mx = max(mx, r - l + 1);
            }
        }
    }
    cout << cnt << "\n" << mx;
}