#include <bits/stdc++.h>
using namespace std;

using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
  return is >> p.FF >> p.SS;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
  return os << p.FF << " " << p.SS;
}
template<class T>
void maxi(T& x, T y){
  if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
  if(x > y) x = y;
}


const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL MOD = 1e9+7;

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

  LL N, K, Q;
  cin >> N >> K >> Q;

  vector<PII> qs(Q);
  REP(i,Q){
	char a;
	int j, c;
	cin >> a >> j >> c;
	if(a == 'R')
	  qs[i] = MP(-j, c-1);
	else
	  qs[i] = MP(j, c-1);
  }

  LL rest = N * N;
  vector<LL> ans(K);
  set<int> xs, ys;
  for(int q=Q-1;q>=0;--q){
	int i = qs[q].FF;
	int c = qs[q].SS;
	if(i < 0){ // row
	  i = -i - 1;
	  if(ys.count(i)) continue;
	  ans[c] += N - SZ(xs);
	  rest -= N - SZ(xs);
	  ys.insert(i);
	}
	else{ // col
	  i--;
	  if(xs.count(i)) continue;
	  ans[c] += N - SZ(ys);
	  rest -= N - SZ(ys);
	  xs.insert(i);
	}
  }
  ans[0] += rest;

  for(auto n : ans)
	cout << n << endl;

  return 0;
}