#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

    int M, N, P;
    cin >> M >> N >> P;

    int majority_count = 0;
    int max_streak = 0;

    for (int i = 0; i < M; i++) {
        vector<int> row(N);
        vector<int> freq(250001, 0);

        int current_color, max_freq = 0, total = 0;
        int local_max_streak = 1, streak = 1;

        cin >> row[0];
        freq[row[0] % 250001]++;
        current_color = row[0];
        total++;

        for (int j = 1; j < N; j++) {
            cin >> row[j];
            freq[row[j] % 250001]++;
            total++;

            if (row[j] == row[j - 1]) {
                streak++;
                local_max_streak = max(local_max_streak, streak);
            } else {
                streak = 1;
            }
        }

        for (int k = 0; k <= 250000; k++) {
            if (freq[k] > total / 2) {
                majority_count++;
                break;
            }
        }

        max_streak = max(max_streak, local_max_streak);
    }

    cout << majority_count << "\n" << max_streak << "\n";

    return 0;
}