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

#define int long long
#define fr(n) for(int i =0; i<n; i++)
#define frj(n) for(int j =0; j<n; j++)

signed main() {
    int m, n, p, x;
    cin >> m >> n >> p;
    vector<vector<int>> a;
    a.resize(m, vector<int>(n));
    int temp = 0, cnt = 0, max = 0, ans = 0;
    fr(m) {
        cnt = 0;
        temp = 0;
        frj(n) {
            cin >> a[i][j];
            if (a[i][j] == temp)
                cnt++;
            else {
                temp = a[i][j];
                cnt = 1;
            }
            if (cnt > max) {
            max = cnt;
        }
        }

    }

    int ans2 = 0;
    for (int i = 0; i < m; i++) {
        sort(a[i].begin(), a[i].end());
        bool b = false;
        temp = 0;
        cnt = 0;
        for (int j = 0; j < n; j++) {
            if (a[i][j] == temp) {
                cnt++;
            }
            else {
                temp = a[i][j];
                cnt = 1;
            }
            if (cnt > n / 2) {
                b = true;
            }
        }
        if (b) ans2++;
    }

    cout << ans2 << endl << max;

    return 0;

}