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

int main() {
  int n, k, q;
  cin >> n >> k >> q;
  vector<tuple<int, int, int>> ve;

  for (int i = 0; i < q; i++) {
    char a;
    int b, c;
    cin >> a >> b >> c;
    b--, c--;
    ve.emplace_back(a == 'R', b, c);
  }
  reverse(ve.begin(), ve.end());

  vector<long long> ans(k);
  set<int> mar, mac;

  for (auto v : ve) {
    int x, b, c;
    tie(x, b, c) = v;
    if (x) {
      if (mar.count(b) == 0) {
        ans[c] += n - mac.size();
        mar.insert(b);
      }
    } else {
      if (mac.count(b) == 0) {
        ans[c] += n - mar.size();
        mac.insert(b);
      }
    }
  }
  
  ans[0] += (long long) (n - mac.size()) * (n - mar.size());
  for (int i = 0; i < k; i++) {
    cout << ans[i] << endl;
  }

  return 0;
}