#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF INT_MAX/3

ll n,k,q;
ll qa[101010],qb[101010],qc[101010];
ll res[101010];
bool r_used[101010],c_used[101010];

int main(){
	cin>>n>>k>>q;
  rep(i,q){
    char c;
    ll a,b;
    cin>>c>>a>>b;
    a--; b--;
    if(c=='R'){
      qa[i]=0;
      qb[i]=a; qc[i]=b;
    }else{
      qa[i]=1;
      qb[i]=a; qc[i]=b;
    }
  }

  ll nr=n,nc=n;
  for(ll i=q-1;i>=0;i--){
    if(qa[i]==0&&!r_used[qb[i]]){
      r_used[qb[i]]=true;
      res[qc[i]]+=nc;
      nr--;
    }else if(qa[i]==1&&!c_used[qb[i]]){
      c_used[qb[i]]=true;
      res[qc[i]]+=nr;
      nc--;
    }
  }
  res[0]+=nr*nc;  
  rep(i,k)cout<<res[i]<<endl;
	return 0;
}