//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

#define N 100100

//head

int n, k, q;
char a[N];
int b[N], c[N];
bitset<N> rc[2];
int cnt[2];
ll color[N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> k >> q;
	rep(i, q) {
		cin >>  a[i] >> b[i] >> c[i];
	}
	for(int i = q-1; i >= 0; i--) {
		b[i]--; c[i]--;
		int id = 0;
		if(a[i] == 'R') id = 1;
		if(rc[id].test(b[i])) continue;
		cnt[id]++;
		color[c[i]] += n-cnt[id^1];
		rc[id].set(b[i]);
	}
	color[0] += (ll)(n-cnt[0]) * (n-cnt[1]);
	rep(i, k) {
		cout << color[i] << endl;
	}
}