#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 100000;
int n, k, q;
pair<int, int> r[N], c[N];
long long int ct[N];
int main() {
	cin >> n >> k >> q;
	for (int i = 0; i < n; i++) { r[i] = make_pair(-i*2-2, 0); c[i] = make_pair(-i*2-1, 0); }
	for (int i = 0; i < q; i++) {
		char v1; int v2, v3; cin >> v1 >> v2 >> v3;
		if (v1 == 'R')r[v2 - 1] = make_pair(i, v3-1);
		else c[v2 - 1] = make_pair(i, v3-1);
	}
	sort(r, r + n);
	sort(c, c + n);
	for (int i = 0; i < n; i++) {
		ct[r[i].second]+= lower_bound(c, c + n, r[i]) - c;
		ct[c[i].second] += lower_bound(r, r + n, c[i]) - r;
	}
	for (int i = 0; i < k; i++)cout << ct[i] << endl;
	return 0;
}