#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct SegTree {
  int size;
  vector<ll> pos;
  SegTree(ll N) { size = 1; while(size<N) size<<=1; pos.resize(2*size,0); }
  ll operator[](const ll &x) const { return pos[x+size]; }

  void build() { per(i,size) operate(i); }
  void set(ll x, const ll v) { pos[x+size] = v; }
  void update(ll x, const ll v) { set(x,v); x+=size; while (x>>=1) operate(x); }
  ll query(ll a, ll b) {
    ll L = 0, R = 0;
    for (a+=size, b+=size; a<b; a>>=1, b>>=1) {
      if (a&1) { L = q(L,pos[a]); a++; }
      if (b&1) { b--; R = q(R,pos[b]); }
    }
    return q(L,R);
  }
  void operate(ll i) { pos[i] = pos[i*2] + pos[i*2+1]; }
  ll q(ll x, ll y) { return x + y; }
};

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct query { char A; ll B, C; };

int main() {
  ll N, K, Q; cin >> N >> K >> Q;
  query q[Q]; rep(i,Q) { cin >> q[i].A >> q[i].B >> q[i].C; q[i].B--; q[i].C--; }
  vector<ll> row(N,-1), col(N,-1);
  rep(i,Q) { if (q[i].A=='R') row[q[i].B] = i; else col[q[i].B] = i; }
  // debug(all(row)); debug(all(col));

  ll result[K] = {};
  SegTree st_row(Q); rep(i,N) if (row[i]!=-1) st_row.update(row[i], 1);
  rep(i,N) if (col[i]!=-1) result[q[col[i]].C] += N - st_row.query(col[i],Q);

  SegTree st_col(Q); rep(i,N) if (col[i]!=-1) st_col.update(col[i], 1);
  rep(i,N) if (row[i]!=-1) result[q[row[i]].C] += N - st_col.query(row[i],Q);

  result[0] = N*N; repr(i,1,K) result[0] -= result[i];
  rep(i,K) cout << result[i] << endl;
  return 0;
}