#include <bits/stdc++.h>
using namespace std;
const long long UNDEF = -1;
const long long INF = 1e18;
template <typename T>
inline bool chkmax(T& aa, T bb) {
  return aa < bb ? aa = bb, true : false;
}
template <typename T>
inline bool chkmin(T& aa, T bb) {
  return aa > bb ? aa = bb, true : false;
}
static char stdinBuffer[1024];
static char* stdinDataEnd = stdinBuffer + sizeof(stdinBuffer);
static const char* stdinPos = stdinDataEnd;
void readAhead(size_t amount) {
  size_t remaining = stdinDataEnd - stdinPos;
  if (remaining < amount) {
    memmove(stdinBuffer, stdinPos, remaining);
    size_t sz = fread(stdinBuffer + remaining, 1,
                      sizeof(stdinBuffer) - remaining, stdin);
    stdinPos = stdinBuffer;
    stdinDataEnd = stdinBuffer + remaining + sz;
    if (stdinDataEnd != stdinBuffer + sizeof(stdinBuffer)) *stdinDataEnd = 0;
  }
}
int readInt() {
  readAhead(16);
  int x = 0;
  bool neg = false;
  while (*stdinPos == ' ' || *stdinPos == '\n') ++stdinPos;
  if (*stdinPos == '-') {
    ++stdinPos;
    neg = true;
  }
  while (*stdinPos >= '0' && *stdinPos <= '9') {
    x *= 10;
    x += *stdinPos - '0';
    ++stdinPos;
  }
  return neg ? -x : x;
}
set<int, greater<int> > s[2];
set<pair<int, int>, greater<pair<int, int> > > p[2];
const int maxn = 2e5 + 4;
int v[2][maxn];
const int X = 0, Y = 1;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int w, h, n;
  scanf("%d %d %d\n", &w, &h, &n);
  s[X].insert(0);
  p[X].insert(make_pair(w, 0));
  v[X][0] = w;
  s[Y].insert(0);
  p[Y].insert(make_pair(h, 0));
  v[Y][0] = h;
  for (int q = 0; q < n; q++) {
    char c;
    int coord;
    scanf("%c %d\n", &c, &coord);
    int t = (c == 'H') ? Y : X;
    int ry = coord;
    auto it = s[t].lower_bound(ry);
    int ly = *it;
    int lh = v[t][ly];
    p[t].erase(make_pair(lh, ly));
    int newlh = ry - ly;
    int newrh = lh - newlh;
    v[t][ly] = newlh;
    v[t][ry] = newrh;
    p[t].insert(make_pair(newlh, ly));
    p[t].insert(make_pair(newrh, ry));
    s[t].insert(ry);
    long long ans = ((long long)(p[0].begin()->first) * p[1].begin()->first);
    printf("%lld\n", ans);
  }
}
