#include <bits/stdc++.h>
using namespace std;
const int INF = 1000 * 1000 * 1000;
const int MOD = 1000 * 1000 * 1000 + 7;
const long INF_L = 1000 * 1000 * 1000;
const long long INF_LL = 1LL * INF_L * INF_L;
const long long MOD_LL = 1000000000007LL;
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
int main() {
  int w, h, n;
  cin >> w >> h >> n;
  vector<int> rw(w + 1, -1), lw(w + 1, -1), rh(h + 1, -1), lh(h + 1, -1);
  vector<pair<char, int> > cuts(n);
  for (int i = 0; i < n; ++i) {
    char c;
    int p;
    cin >> c >> p;
    if (c == 'H') {
      rh[p] = lh[p] = 0;
    } else {
      rw[p] = lw[p] = 0;
    }
    cuts[i] = make_pair(c, p);
  }
  int l = 0;
  long long maxh = 1;
  lh[h] = rh[h] = lh[0] = rh[0] = 0;
  for (int i = 1; i <= h; ++i) {
    if (rh[i] == 0) {
      lh[i] = l;
      rh[l] = i;
      maxh = max(maxh, 1LL * i - l);
      l = i;
    }
  }
  maxh = max(maxh, 1LL * h - l);
  l = 0;
  long long maxw = 1;
  lw[w] = rw[w] = lw[0] = rw[0] = 0;
  for (int i = 1; i <= w; ++i) {
    if (rw[i] == 0) {
      lw[i] = l;
      rw[l] = i;
      maxw = max(maxw, 1LL * i - l);
      l = i;
    }
  }
  maxw = max(maxw, 1LL * w - l);
  vector<long long> ans(n, 0);
  for (int i = n - 1; i >= 0; --i) {
    ans[i] = maxh * maxw;
    if (cuts[i].first == 'H') {
      rh[lh[cuts[i].second]] = rh[cuts[i].second];
      lh[rh[cuts[i].second]] = lh[cuts[i].second];
      maxh = max(maxh, 1LL * rh[cuts[i].second] - lh[cuts[i].second]);
    } else {
      rw[lw[cuts[i].second]] = rw[cuts[i].second];
      lw[rw[cuts[i].second]] = lw[cuts[i].second];
      maxw = max(maxw, 1LL * rw[cuts[i].second] - lw[cuts[i].second]);
    }
  }
  for (auto i : ans) {
    cout << i << endl;
  }
  return 0;
}
