#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
  int n, k, q;
  cin >> n >> k >> q;

  vector<int> a(q), b(q), c(q);
  for (int i = 0; i < q; i++) {
    char tmp;
    cin >> tmp >> b[i] >> c[i];
    a[i] = tmp == 'C';
    b[i]--;
    c[i]--;
  }

  vector<bool> used_row(n);
  vector<bool> used_col(n);
  long long left_row = n;
  long long left_col = n;
  vector<long long> cnt(k);
  for (int i = q - 1; i >= 0; i--) {
    if (a[i]) {
      // col
      if (used_col[ b[i] ]) continue;
      used_col[ b[i] ] = true;
      cnt[ c[i] ] += left_row;
      left_col--;
    } else {
      // row
      if (used_row[ b[i] ]) continue;
      used_row[ b[i] ] = true;
      cnt[ c[i] ] += left_col;
      left_row--;
    }
  }

  cnt[0] += left_row * left_col;

  for (int i = 0; i < k; i++) {
    cout << cnt[i] << endl;
  }
}