#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N, K, Q;
ll cnt[100000];
char A[100000];
int B[100000], C[100000];
set<int> r, c;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> K >> Q;
    for(int i = 0; i < N; i++){
        c.insert(i); r.insert(i);
    }
    for(int i = 0; i < Q; i++){
        cin >> A[i] >> B[i] >> C[i];
        B[i]--; C[i]--;
    }
    for(int i = Q-1; i >= 0; i--){
        if(A[i] == 'R'){
            if(r.count(B[i]) == 0) continue;
            cnt[C[i]] += c.size();
            r.erase(B[i]);
        }else{
            if(c.count(B[i]) == 0) continue;
            cnt[C[i]] += r.size();
            c.erase(B[i]);
        }
    }
    ll total = (ll)N*(ll)N;
    for(int i = 0; i < K; i++) total -= cnt[i];
    cnt[0] += total;
    for(int i = 0; i < K; i++) cout << cnt[i] << endl;
}