#include <bits/stdc++.h>
using namespace std;
const int N = 200000 + 50;
set<int> W;
set<int> H;
int lenw[N], lenh[N];
int main() {
  int w, h, T, b;
  char a;
  long long max_w, max_h;
  cin >> w >> h >> T;
  W.insert(w);
  W.insert(0);
  H.insert(h);
  H.insert(0);
  set<int>::iterator fuck, fuck2;
  memset(lenw, 0, sizeof(lenw));
  memset(lenh, 0, sizeof(lenh));
  lenw[w]++;
  lenh[h]++;
  max_w = w;
  max_h = h;
  getchar();
  max_w = w;
  max_h = h;
  while (T--) {
    int l, r;
    scanf("%c ", &a);
    scanf("%d", &b);
    getchar();
    if (a == 'V') {
      W.insert(b);
      fuck = fuck2 = W.find(b);
      fuck--;
      fuck2++;
      l = *fuck;
      r = *fuck2;
      lenw[r - l]--;
      lenw[b - l]++;
      lenw[r - b]++;
    } else {
      H.insert(b);
      fuck = fuck2 = H.find(b);
      fuck--;
      fuck2++;
      l = *fuck;
      r = *fuck2;
      lenh[r - l]--;
      lenh[b - l]++;
      lenh[r - b]++;
    }
    while (!lenw[max_w]) max_w--;
    while (!lenh[max_h]) max_h--;
    cout << max_h * max_w << endl;
  }
  return 0;
}
