// Source: https://usaco.guide/general/io

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

int main() {
	int m, n, k;
	cin >> m >> n >> k;
	int db = 0, maxi = 0;
	for (int i = 0; i < m; i++) {
		map<int, int> a;
		int last = 0, crdb = 0, crmaxi = 0;
		for (int j = 0; j < n; j++) {
			int b;
			cin >> b;
			if (b == last) crdb++;
			else {
				crdb = 1;
				last = b;
			}
			if (crdb > maxi) maxi = crdb;
			a[b]++;
			if (a[b] > crmaxi) crmaxi = a[b];
		}
		
		if (crmaxi > n / 2) db++;
	}

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