#include <bits/stdc++.h>
using namespace std;
int L[200007], R[200007], Size[200007];
int Max[200007], Sum[200007], Key[200007];
int IP;
void Init() {
  L[0] = R[0] = Size[0] = 0;
  Max[0] = Sum[0] = Key[0] = 0;
  IP = 0;
}
void PushUp(int rt) {
  Size[rt] = 1 + Size[L[rt]] + Size[R[rt]];
  Sum[rt] = Key[rt] + Sum[L[rt]] + Sum[R[rt]];
  Max[rt] = max(Key[rt], max(Max[L[rt]], Max[R[rt]]));
}
void zig(int &rt) {
  int t = R[rt];
  R[rt] = L[t];
  L[t] = rt;
  PushUp(rt);
  PushUp(t);
  rt = t;
}
void zag(int &rt) {
  int t = L[rt];
  L[rt] = R[t];
  R[t] = rt;
  PushUp(rt);
  PushUp(t);
  rt = t;
}
void maintain(int &rt) {
  if (Size[L[L[rt]]] > Size[R[rt]]) {
    zag(rt);
    maintain(R[rt]);
    maintain(rt);
    return;
  }
  if (Size[R[R[rt]]] > Size[L[rt]]) {
    zig(rt);
    maintain(L[rt]);
    maintain(rt);
    return;
  }
  if (Size[R[L[rt]]] > Size[R[rt]]) {
    zig(L[rt]);
    zag(rt);
    maintain(L[rt]);
    maintain(R[rt]);
    return;
  }
  if (Size[L[R[rt]]] > Size[L[rt]]) {
    zag(R[rt]);
    zig(rt);
    maintain(R[rt]);
    maintain(L[rt]);
    return;
  }
}
void InsertLeft(int &rt, int X) {
  if (rt) {
    InsertLeft(L[rt], X);
    PushUp(rt);
    maintain(rt);
  } else {
    rt = ++IP;
    Sum[rt] = Max[rt] = Key[rt] = X;
    Size[rt] = 1;
    L[rt] = R[rt] = 0;
  }
}
void Insert(int &rt, int X) {
  if (X < Sum[L[rt]]) {
    Insert(L[rt], X);
    PushUp(rt);
    maintain(rt);
    return;
  }
  X -= Sum[L[rt]];
  if (X > Key[rt]) {
    Insert(R[rt], X - Key[rt]);
    PushUp(rt);
    maintain(rt);
    return;
  }
  InsertLeft(R[rt], Key[rt] - X);
  Key[rt] = X;
  PushUp(rt);
}
void Show(int rt) {
  if (L[rt]) Show(L[rt]);
  printf("%d ", Key[rt]);
  if (R[rt]) Show(R[rt]);
}
int w, h, n;
int main(void) {
  while (cin >> w >> h >> n) {
    Init();
    int H = 0, V = 0;
    InsertLeft(H, h);
    InsertLeft(V, w);
    for (int i = 0; i < n; ++i) {
      char a;
      int v;
      scanf(" %c%d", &a, &v);
      a == 'H' ? Insert(H, v) : Insert(V, v);
      printf("%I64d\n", (long long)Max[H] * Max[V]);
    }
  }
  return 0;
}
