#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
#define INF (1001001001)
#define INFLL (1001001001001001001ll)
template<class T> ostream& operator << (ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v)) os<<*i<<(i==end(v)-1?"":"\n"); return os; }
template<class T> istream& operator >> (istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i; return is; }
template<class T> istream& operator >> (istream &is, pair<T,T> &p) {
    is>>p.first>>p.second; return is; }
template <class T> bool chmax(T &a,const T &b) {if(a<b) {a=b;return 1;} return 0;}
template <class T> bool chmin(T &a,const T &b) {if(b<a) {a=b;return 1;} return 0;}
template <class T> using heap = priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        #ifdef int
            #undef INF
            #define INF INFLL
            #define stoi stoll
        #endif
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

signed main() {
    int N,K,Q;
    cin>>N>>K>>Q;
    map<int,pii> R,C;
    set<int> R_idx,C_idx;
    REP(i,Q) {
        string a;
        int b,c;
        cin>>a>>b>>c;
        b--;
        if(a=="R") {
            if(CONTAIN(R,b) && CONTAIN(R_idx,R[b].second)) {
                R_idx.erase(R[b].second);
            }
            R_idx.insert(i);
            R[b]={c,i};
        }
        else {
            if(CONTAIN(C,b) && CONTAIN(C_idx,C[b].second)) {
                C_idx.erase(C[b].second);
            }
            C_idx.insert(i);
            C[b]={c,i};
        }
    }
    vector<int> R_idx_v(ALL(R_idx)),C_idx_v(ALL(C_idx));
    sort(ALL(R_idx_v));
    sort(ALL(C_idx_v));

    vector<int> ans(K,0);
    REP(i,N) {
        if(!CONTAIN(R,i)) continue;
        int tmp=distance(lower_bound(ALL(C_idx_v),R[i].second),end(C_idx_v));
        ans[R[i].first-1]+=N-tmp;
    }
    REP(j,N) {
        if(!CONTAIN(C,j)) continue;
        int tmp=distance(lower_bound(ALL(R_idx_v),C[j].second),end(R_idx_v));
        ans[C[j].first-1]+=N-tmp;
    }
    int sum=0;
    REP(i,K) {
        sum+=ans[i];
    }
    ans[0]+=N*N-sum;
    cout<<ans<<endl;
    return 0;
}