#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long Max(long long a, long long b) { return a > b ? a : b; }
long long Min(long long a, long long b) { return a < b ? a : b; }
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = ((res % p) * (x % p)) % p;
    y = y >> 1;
    x = ((x % p) * (x % p)) % p;
  }
  return res;
}
bool isprime(long long n) {
  long long z = sqrt(n);
  if (n == 2) return true;
  if (n % 2 == 0) return false;
  for (long long i = 3; i <= z; i += 2) {
    if (n % i == 0) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long w, h, n;
  cin >> w >> h >> n;
  set<long long> hor, ver;
  map<long long, long long> hord, verd;
  ver.insert(0);
  ver.insert(w);
  hor.insert(0);
  hor.insert(h);
  hord[w] = 1;
  verd[h] = 1;
  for (long long i = 0; i < n; i++) {
    char c;
    long long z;
    cin >> c >> z;
    if (c == 'H') {
      set<long long>::iterator in = hor.lower_bound(z);
      long long hup = *in;
      long long hdown = *(--in);
      hor.insert(z);
      long long d = abs(hup - hdown);
      verd[d]--;
      verd[(abs(hup - z))]++;
      verd[(abs(hdown - z))]++;
      if (verd[d] == 0) verd.erase(d);
      verd.erase(0);
    } else {
      set<long long>::iterator in = ver.lower_bound(z);
      long long vright = *in;
      long long vleft = *(--in);
      ver.insert(z);
      long long d = abs(vright - vleft);
      hord[d]--;
      hord[(abs(vright - z))]++;
      hord[(abs(vleft - z))]++;
      if (hord[d] == 0) hord.erase(d);
      hord.erase(0);
    }
    cout << ((hord.rbegin())->first) * ((verd.rbegin())->first) << endl;
  }
  return 0;
}
