/* -*- coding: utf-8 -*-
 *
 * 606.cc: No.606 カラフルタイル - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_K = 100000;
const int MAX_QN = 100000;

/* typedef */

typedef long long ll;

enum { ROW, COL };

struct Query {
  int a, b, c;
  Query() {}
  Query(int _a, int _b, int _c): a(_a), b(_b), c(_c) {}
};

/* global variables */

Query qs[MAX_QN];
bool rused[MAX_N], cused[MAX_N];
ll cnts[MAX_K];

/* subroutines */

/* main */

int main() {
  int n, k, qn;
  scanf("%d%d%d", &n, &k, &qn);

  for (int i = 0; i < qn; i++) {
    char sc[2];
    scanf("%s%d%d", sc, &qs[i].b, &qs[i].c);
    qs[i].a = (sc[0] == 'R') ? ROW : COL;
    qs[i].b--, qs[i].c--;
  }

  ll sum = 0;
  int rc = n, cc = n;

  for (int i = qn - 1; i >= 0; i--) {
    Query &qi = qs[i];
    if (qi.a == ROW) {
      if (! rused[qi.b]) {
	rused[qi.b] = true;
	cnts[qi.c] += rc;
	sum += rc;
	cc--;
      }
    }
    else {
      if (! cused[qi.b]) {
	cused[qi.b] = true;
	cnts[qi.c] += cc;
	sum += cc;
	rc--;
      }
    }
  }

  cnts[0] += (ll)n * n - sum;

  for (int i = 0; i < k; i++) printf("%lld\n", cnts[i]);
  return 0;
}