#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


int main(){
    ll h,w,N,C,q;cin >> N >> C >> q;
    h=N,w=N;
    vvl g(q);
    rep(i,q){
        char x;cin >> x;
        ll t,n,c;cin >> n >> c;n--;c--;
        if(x=='R')t=1;
        else t=2;
        g[i].emplace_back(t);
        g[i].emplace_back(n);
        g[i].emplace_back(c);
    }
    set<ll> r,c;
    vl ans(C);
    per(i,q){
        if(g[i][0]==1){
            if(r.count(g[i][1]))continue;
            r.insert(g[i][1]);
            ans[g[i][2]]+=w-c.size();
        }
        else{
            if(c.count(g[i][1]))continue;
            c.insert(g[i][1]);
            ans[g[i][2]]+=h-r.size();
        }
    }
    ll p=accumulate(all(ans),0LL)-ans[0];
    ans[0]=h*w-p;
    rep(i,C)cout << ans[i]  << endl;
}