#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

ll dy[100100];
ll dx[100100];
ll dy1[100100];
ll dx1[100100];
ll dd[100100];

int main() {
  ll n,k,q;
  cin>>n>>k>>q;
  vector<pair<pair<ll,ll>,ll > > v;
  rep(i,0,q){
    char a;
    ll b,c;
    cin>>a>>b>>c;
    b--;c--;
    if(a=='R'){
      v.pb(mp(mp(0,b),c));
    }
    else{
      v.pb(mp(mp(1,b),c));
    }
  }
  reverse(all(v));
  clr(dy,0);
  clr(dx,0);
  clr(dy1,0);
  clr(dx1,0);
  clr(dd,0);
  vector<pair<pair<ll,ll>,ll > > v1;
  rep(i,0,v.sz){
    if(v[i].fi.fi==0){
      if(dy[v[i].fi.se]==0){
        dy[v[i].fi.se] = 1;
        v1.pb(mp(mp(0,v[i].fi.se),v[i].se));
      }
    }
    else{
      if(dx[v[i].fi.se]==0){
        dx[v[i].fi.se] = 1;
        v1.pb(mp(mp(1,v[i].fi.se),v[i].se));
      }      
    }
  }
  reverse(all(v1));
  rep(i,0,v1.sz){
    if(v1[i].fi.fi==0){
      dy1[i] = 1;
    }
    else{
      dx1[i] = 1;
    }
  }
  per(i,1,100100){
    dy1[i-1]+=dy1[i];
    dx1[i-1]+=dx1[i];
  }
  rep(i,0,v1.sz){
    if(v1[i].fi.fi==0){
      dd[v1[i].se] += (n-dx1[i]);
    }
    else{
      dd[v1[i].se] += (n-dy1[i]);
    }
  }
  ll c = 0;
  rep(i,0,k){
    c+=dd[i];
  }
  dd[0] += n*n-c;
  rep(i,0,k){
    printf("%lld\n",dd[i]);
  }
  return 0;
}