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

using ll = long long;

int N, K, Q;
char a[100000];
int b[100000], c[100000];

char vr[100000], vc[100000];

int main() {
    cin.tie(0); ios::sync_with_stdio(false);
    cin >> N >> K >> Q;
    for (int j = 0; j < Q; ++j) {
        cin >> a[j] >> b[j] >> c[j];
        --b[j]; --c[j];
    }

    ll ans[100000], s = 0;
    fill(ans, ans+K, 0);
    int ir = N, ic = N;
    for (int j = Q-1; j >= 0; --j) {
        if (a[j] == 'R' && !vr[b[j]]) {
            s += ir;
            ans[c[j]] += ir;
            vr[b[j]] = true;
            --ic;
        }
        if (a[j] == 'C' && !vc[b[j]]) {
            s += ic;
            ans[c[j]] += ic;
            vc[b[j]] = true;
            --ir;
        }
    }
    ans[0] += (ll)N*N - s;
    for (int j = 0; j < K; ++j) {
        cout << ans[j] << endl;
    }
    return 0;
}