#include <bits/stdc++.h>

using namespace std;
using LL = long long int;

#define int long long

const int MAX_N = 100005;

int N;
int K;
int Q;

char A[MAX_N];
int B[MAX_N], C[MAX_N];
int Ans[MAX_N];

signed main()
{
  cin >> N >> K >> Q;
  for(int i = 0; i < Q; i++) {
    cin >> A[i] >> B[i] >> C[i];
  }

  int rr = 0;
  int cc = 0;
  int S = 0;
  unordered_set<int> RSet, CSet;

  for(int q = Q-1; 0 <= q; q--) {
    if(A[q] == 'R') {
      if(RSet.insert(B[q]).second) {
        Ans[C[q]] += N - cc;
        rr++;
      }
    } else {
      if(CSet.insert(B[q]).second) {
        Ans[C[q]] += N - rr;
        cc++;
      }
    }
  }

  for(int i = 1; i <= K; i++) {
    S += Ans[i];
  }
  Ans[1] += N*N - S;

  for(int i = 1; i <= K; i++) {
    cout << Ans[i] << endl;
  }

  return 0;
}