#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=n-1;i>=(0);i--)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define eall(v) unique(all(v), v.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll INFF = 1e18;

int N, K, Q;
char A[100010];
int B[100010], C[100010];
ll ans[100010];

int main() {
	cin >> N >> K >> Q;
	rep(i, Q) cin >> A[i] >> B[i] >> C[i];
	rep(i, Q) C[i]--;

	set<int> sc, sr;

	REP(i, Q) {
		if(A[i] == 'C') {
			if(sc.count(B[i]) == 0) {
				ans[C[i]] += N - static_cast<int>(sr.size());
				sc.insert(B[i]);
			}
		}else{
			if(sr.count(B[i]) == 0) {
				ans[C[i]] += N - static_cast<int>(sc.size());
				sr.insert(B[i]);
			}
		}
	}
	ll sum = 0;
	rep(i, K) sum += ans[i];
	if(sum != (ll)N * N) ans[0] = (ll)N * N - sum;
	rep(i, K) printf("%lld\n", ans[i]);

	return 0;
}