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

int main() {
	int64_t n, k, q;
	cin >> n >> k >> q;
	char a[q];
	int b[q], c[q];
	for (int i = 0; i < q; i++) {
		cin >> a[i] >> b[i] >> c[i];
	}
	reverse(a, a + q);
	reverse(b, b + q);
	reverse(c, c + q);
	bool puni[n]{}, muni[n]{};
	int64_t ans[k]{}, row = n, column = n;
	for (int i = 0; i < q; i++) {
		if (a[i] == 'R') {
			if (puni[b[i] - 1]) {
				continue;
			}
			puni[b[i] - 1] = true;
			ans[c[i] - 1] += row;
			column--;
		} else {
			if (muni[b[i] - 1]) {
				continue;
			}
			muni[b[i] - 1] = true;
			ans[c[i] - 1] += column;
			row--;
		}
	}
	ans[0] += n * n - accumulate(ans, ans + k, int64_t(0));
	for (auto &i : ans) {
		cout << i << endl;
	}
	return 0;
}