#include <bits/stdc++.h>

#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz=" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = 1e9 + 7;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

struct Query {
    char A;
    int B;
    int C;
};
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N, K, Q;
    cin >> N >> K >> Q;
    ll r = N;
    ll c = N;
    vector<bool> rused(N, false);
    vector<bool> cused(N, false);
    vector<ll> num(K, 0);
    vector<Query> query(Q);
    for (int q = 0; q < Q; q++) {
        char A;
        int B, C;
        cin >> A >> B >> C;
        B--, C--;
        query[q] = Query{A, B, C};
    }
    reverse(query.begin(), query.end());
    for (int q = 0; q < Q; q++) {
        char A = query[q].A;
        int B = query[q].B;
        int C = query[q].C;
        if (A == 'R') {
            if (not rused[B]) {
                r--;
                num[C] += c;
                rused[B] = true;
            }
        } else {
            if (not cused[B]) {
                c--;
                num[C] += r;
                cused[B] = true;
            }
        }
    }
    num[0] = N * N;
    for (int i = 1; i < K; i++) {
        num[0] -= num[i];
    }
    for (int i = 0; i < K; i++) {
        cout << num[i] << endl;
    }

    return 0;
}