#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,k,q;
int a[125252][4], b[125252], c[125252];

bool row[125252], col[125252];
ll ans[125252];

int main(){
  scanf("%d%d%d",&n,&k,&q);
  REP(i,q){
    scanf("%s%d%d",a[i],b+i,c+i);
  }
  REP(i,n)row[i]=true;
  REP(i,n)col[i]=true;
  ll sum = 0;
  ll rcnt = n, ccnt = n;
  FORR(i,0,q){
    int typ = c[i]-1;
    int id = b[i]-1;
    if(a[i][0]=='R'){
      if(row[id]){
        ans[typ] += ccnt;
        rcnt--;
        row[id]=false;
      }
    }else{
      if(col[id]){
        ans[typ] += rcnt;
        ccnt--;
        col[id]=false;
      }
    }
  }
  FOR(i,1,k)sum += ans[i];
  ans[0] = (ll)n*n-sum;
  REP(i,k)printf("%lld\n",ans[i]);
  return 0;
}