#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
const int M = 1e9;
const int inf = 1e9 + 7;
const long long base = 1e18;
const double pi = acos(-1);
const double ep = 1e-9;
class doubleLinkList {
 public:
  int next[N], pre[N];
  int first;
  int pos[N];
  int remove(int x) {
    int p = pre[x];
    int n = next[x];
    next[p] = n;
    pre[n] = p;
    return n - p;
  }
  void add(int x) {
    next[x] = first;
    pre[first] = x;
    pre[x] = 0;
    first = x;
  }
};
doubleLinkList X, Y;
int a[N];
long long res[N];
int n, m, q;
vector<pair<int, int> > query;
int main() {
  scanf("%d%d%d\n", &n, &m, &q);
  for (int i = (int)0; i < (int)q; i++) {
    char c;
    int u;
    scanf("%c%d\n", &c, &u);
    if (c == 'H')
      query.push_back(make_pair(1, u));
    else
      query.push_back(make_pair(0, u));
  }
  int lastX = 0, lastY = 0;
  memset(a, 0, sizeof(a));
  for (int i = q - 1; i > -1; i--) {
    if (query[i].first == 0) a[query[i].second] = 1;
  }
  a[0] = 1;
  X.first = n + 1;
  X.add(n);
  int last = n;
  for (int i = n - 1; i >= 0; i--) {
    if (a[i] == 1) {
      X.add(i);
      lastX = max(lastX, last - i);
      last = i;
    }
  }
  memset(a, 0, sizeof(a));
  for (int i = q - 1; i > -1; i--) {
    if (query[i].first == 1) a[query[i].second] = 1;
  }
  a[0] = 1;
  last = m;
  Y.first = m + 1;
  Y.add(m);
  for (int i = m - 1; i >= 0; i--) {
    if (a[i] == 1) {
      Y.add(i);
      lastY = max(lastY, last - i);
      last = i;
    }
  }
  res[q] = (long long)lastX * lastY;
  for (int i = q - 1; i > 0; i--) {
    if (query[i].first == 0) {
      lastX = max(lastX, X.remove(query[i].second));
    } else
      lastY = max(lastY, Y.remove(query[i].second));
    res[i] = (long long)lastX * lastY;
  }
  for (int i = (int)1; i < (int)q + 1; i++) {
    printf("%I64d\n", res[i]);
  }
}
