#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))
#define sz(v) ((LLI)(v).size())

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> istream& operator>>(istream &is, pair<T,U> &p){is >> p.first >> p.second; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  LLI N,K,Q;
  while(cin >> N >> K >> Q){
    vector<char> A(Q);
    vector<int> B(Q), C(Q);

    REP(i,Q){
      cin >> A[i] >> B[i] >> C[i];
    }

    vector<LLI> ans(K+1);

    vector<bool> painted_row(N+1), painted_col(N+1);
    int count_r = 0, count_c = 0;

    REV(i,Q-1,0){
      if(A[i] == 'R'){

	if(not painted_row[B[i]]){
	  ans[C[i]] += N-count_c;
	  ++count_r;
	  painted_row[B[i]] = true;
	}
      }else{

	if(not painted_col[B[i]]){
	  ans[C[i]] += N-count_r;
	  painted_col[B[i]] = true;
	  ++count_c;
	}
      }
    }

    ans[1] = N*N;
    FORE(i,2,K) ans[1] -= ans[i];


    FORE(i,1,K){
      cout << ans[i] << endl;
    }

    cerr << endl;
  }
  
  return 0;
}