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

const int N = 100010;
int n, m, T, x, y, c[N], r[N], a[N], s[N], tag, ans;

signed main() {
	freopen("tanabata.in", "r", stdin);
	freopen("tanabata.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> T;
	for (int i = 1; i <= T; i++) {
		cin >> x >> y;
		c[y]++;
		r[x]++;
	}
	if (T % m == 0) {
		tag++;
		for (int i = 1; i <= m; i++) a[i] = c[i] - T / m, s[i] = s[i-1] + a[i];
		sort(s+1, s+1+m);
		for (int i = 1; i <= m; i++) ans += abs(s[i] - s[(m+1)/2]);
	}
	if (T % n == 0) {
		tag += 2;
		for (int i = 1; i <= n; i++) a[i] = r[i] - T / n, s[i] = s[i-1] + a[i];
		sort(s+1, s+1+m);
		for (int i = 1; i <= n; i++) ans += abs(s[i] - s[(n+1)/2]);
	}
	if (tag == 0) cout << "impossible";
	else if (tag == 1) cout << "column " << ans;
	else if (tag == 2) cout << "row " << ans;
	else if (tag == 3) cout << "both " << ans;
	return 0;
}