#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
//19234567892927;
const int mod=1e9+7;
const llint big=1e15+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
int main(void){
	llint i,n,c,q;cin>>n>>c>>q;
	vector<llint>ans(c);
	vector<bool>Rb(n);
	vector<bool>Cb(n);
	int Rn=n,Cn=n;
	vector<tuple<char,int,int>>que(n+q);
	for(i=0;i<n;i++){que[i]=mt('C',i,0);}
	for(i=0;i<q;i++){
		char a;int b,d;
		cin>>a>>b>>d;b--;d--;
		que[n+i]=mt(a,b,d);
	}
	reverse(que.begin(),que.end());
	for(i=0;i<n+q;i++){
		char a;int b,d;
		tie(a,b,d)=que[i];
		if(a=='C'){
			if(Cb[b]){continue;}
			Cb[b]=true;
			ans[d]+=Rn;
			Cn--;
		}else{
			if(Rb[b]){continue;}
			Rb[b]=true;
			ans[d]+=Cn;
			Rn--;
		}
	}
	for(auto it:ans){cout<<it<<endl;}
	return 0;
}