#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)///


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, k, q;
	cin >> n >> k >> q;
	vl v(k, 0);
	ll row = n, col = n;
	vector<char> a(q);
	vl b(q), c(q);
	vi rused(n, 0), cused(n, 0);
	REP(i, q)cin >> a[i] >> b[i] >> c[i];
	RREP(i, q) {
		if (a[i] == 'R' && !rused[b[i] - 1]) {
			v[c[i] - 1] += row;
			col--;
			rused[b[i] - 1] = 1;
		}
		if (a[i] == 'C' && !cused[b[i] - 1]) {
			v[c[i] - 1] += col;
			row--;
			cused[b[i] - 1] = 1;
		}
	}
	v[0] += col*row;
	REP(i, k)cout << v[i] << endl;
}