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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n, k, q, b[100000], c[100000]; string a[100000];
bool used[2][100000]; LL remain[2], ans[100000];

int main() {
	cin >> n; assert(inII(n, 1, 100000)); assert(getchar() == ' ');
	cin >> k; assert(inII(k, 1, 100000)); assert(getchar() == ' ');
	cin >> q; assert(inII(q, 1, 100000)); assert(getchar() == '\n');
	inc(i, q) {
		cin >> a[i]; assert(a[i] == "R" || a[i] == "C"); assert(getchar() == ' ');
		cin >> b[i]; assert(inII(b[i], 1, n));           assert(getchar() == ' ');
		cin >> c[i]; assert(inII(c[i], 1, k));           assert(getchar() == '\n');
		b[i]--; c[i]--;
	}
	assert(getchar() == EOF);
	
	remain[0] = remain[1] = n;
	dec(i, q) {
		int rc = (a[i] == "R" ? 0 : 1);
		if(! used[rc][b[i]]) {
			ans[c[i]] += remain[1 - rc];
			used[rc][b[i]] = true;
			remain[rc]--;
		}
	}
	ans[0] += remain[0] * remain[1];
	
	LL sum = 0;
	inc(i, k) { sum += ans[i]; }
	assert(sum == n * n);
	
	inc(i, k) { cout << ans[i] << endl; }
	
	return 0;
}