#include <bits/stdc++.h>
using namespace std;
const int N = 210000;
int fh[N], fw[N], t[N], hh[N], qh[N], hw[N], qw[N];
char s[N][3];
long long ans[N];
int main() {
  int w, h, n;
  scanf("%d%d%d", &w, &h, &n);
  for (int i = 1; i <= n; i++) {
    scanf("%s%d", s[i], &t[i]);
    if (s[i][0] == 'H') {
      fh[t[i]] = 1;
    } else
      fw[t[i]] = 1;
  }
  fh[h] = 1, fw[w] = 1;
  int lh = 0, lw = 0;
  int maxh = 0, maxw = 0;
  for (int i = 0; i < N; i++) {
    if (fh[i]) {
      qh[i] = lh;
      hh[lh] = i;
      maxh = max(maxh, i - lh);
      lh = i;
    }
    if (fw[i]) {
      qw[i] = lw;
      hw[lw] = i;
      maxw = max(maxw, i - lw);
      lw = i;
    }
  }
  for (int i = n; i >= 1; i--) {
    int j = t[i];
    ans[i] = 1ll * maxh * maxw;
    if (s[i][0] == 'H') {
      hh[qh[j]] = hh[j];
      qh[hh[j]] = qh[j];
      maxh = max(maxh, hh[qh[j]] - qh[hh[j]]);
    } else {
      hw[qw[j]] = hw[j];
      qw[hw[j]] = qw[j];
      maxw = max(maxw, hw[qw[j]] - qw[hw[j]]);
    }
  }
  for (int i = 1; i <= n; i++) printf("%I64d\n", ans[i]);
  return 0;
}
