#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define int long long

int n, m, p, ans1, ans2, ans3;
vector<vector<int> > v;

signed main() {
	cin >> n >> m >> p;
	v.resize(n+1, vector<int>(m+1));
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> v[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		int db = 0, t = 0;;
		for (int l = 1; l <= m; l++) {
			if (v[i][l] == t) {
				db++;
				ans1 = max(ans1, db);
			}
			else {
				t = v[i][l];
				db = 1;
				ans1 = max(ans1, db);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		sort(v[i].begin(), v[i].end());
		bool jo = false;
		int db = 0, t = 0;
		for (int j = 1; j <= m; j++) {
			if (v[i][j] == t) {
				db++;
			}
			else {
				t = v[i][j];
				db = 1;
			}
			if (db > ans2) {
				jo = true;
				ans2 = db;
			}
			else if (db == ans2) {
				jo = false;
			}
		}
		if (jo) {
			ans3++;
		}
	}
	cout << ans3 << endl << ans1;
}