#include <iostream>
#include <map>
using namespace std;

using int64 = long long;

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

    int64 N;
    int K, Q;
    cin >> N >> K >> Q;

    map<string, int> mp;
    mp["R"] = 0;
    mp["C"] = 1;

    const int maxq = 200000;
    const int maxn = 200000;
    const int maxk = 200000;

    static string A[maxq];
    static int B[maxq], C[maxq];

    static bool used[2][maxn];
    static int64 ans[maxk];
    for (int i = 0; i < Q; i++) {
        cin >> A[i] >> B[i] >> C[i];
        B[i]--; C[i]--;
    }

    int64 cnt[2] = {0, 0};
    for (int i = Q - 1; i >= 0; i--) {
        int rc = mp[A[i]];
        if (used[rc][B[i]]) continue;

        used[rc][B[i]] = true;
        ans[C[i]] += N - cnt[rc ^ 1];
        cnt[rc]++;
    }

    int64 sum = 0;
    for (int i = 0; i < K; i++) {
        sum += ans[i];
    }
    ans[0] += N * N - sum;

    for (int i = 0; i < K; i++) {
        cout << ans[i] << '\n';
    }

    return 0;
}