#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
#include<math.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef long long ll;
typedef pair<int,int> pint;
const ll mod= 998244353;
const int inf=1e9+7;
const ll  longinf = 1LL<<60;
int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1};

bool used[2][101010];
ll ans[101010];
int main(){
  ll n;cin>>n;
  ll k,q;
  cin>>k>>q;
  ll a[q],b[q],c[q];
  rep(i,q){
    char x;cin>>x;
    a[i]=(x=='C');
    cin>>b[i]>>c[i];
    c[i]--;
    }
  reverse(a,a+q);
  reverse(b,b+q);
  reverse(c,c+q);
  ll x[2];
  x[0]=n,x[1]=n;
  ans[0]=n*n;
  rep(i,q){
    if(used[a[i]][b[i]])continue;
    used[a[i]][b[i]]=1;
    ans[c[i]]+=x[a[i]];
    ans[0]-=x[a[i]];
    x[1-a[i]]--;
    }
  rep(i,k)cout<<ans[i]<<endl;
    
  return 0;
  }