#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include<iomanip>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

char A[100009];
ll B[100009], C[100009];
bool row[100009], col[100009]; // true : もう塗られている

ll cnt[100009];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll N, K, Q; cin >> N >> K >> Q;
	for (int i = 0; i < Q; i++) cin >> A[i] >> B[i] >> C[i];

	ll H = N, W = N;
	set<int> S;

	for (int i = Q - 1; i >= 0 && H > 0 && W > 0; i--) {
		if (A[i] == 'R') {
			if (!row[B[i]]) {
				row[B[i]] = true;
				H--;
				cnt[C[i]] += W;
			}
		}
		else { // A[i] == 'C'
			if (!col[B[i]]) {
				col[B[i]] = true;
				W--;
				cnt[C[i]] += H;
			}
		}
	}

	cnt[1] += H * W;
	for (int i = 1; i <= K; i++) cout << cnt[i] << endl;


	return 0;
}