#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

#define N 100010
char a[N];
int b[N], c[N];
bool used[2][N];

int main(){
	ll h, w, k, q;
	cin>>h>>k>>q;
	w = h;
	ll sum = h*w;
	rep(i, q){
		cin>>a[i]>>b[i]>>c[i];
	}
	vector<ll> res(k);
	for(int i = q-1; i >= 0; i--){
		if(a[i]=='R' && !used[0][b[i]]){
			used[0][b[i]] = true;
			res[c[i]-1] += h;
			w--;
		} else if(a[i]=='C' && !used[1][b[i]]) {
			used[1][b[i]] = true;
			res[c[i]-1] += w;
			h--;
		}
	}
	rep(i, k) sum -= res[i];
	res[0] += sum;
	rep(i, k) cout<<res[i]<<endl;
	return 0;
}