#include <bits/stdc++.h>
using namespace std;
int Set(int N, int pos) { return N |= (1LL << pos); }
int Reset(int N, int pos) { return N &= ~(1LL << pos); }
bool Check(int N, int pos) { return N & (1LL << pos); }
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1}, dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
inline void cn(long &n) {
  n = 0;
  long ch = getchar();
  int sign = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') sign = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    n = (n << 3) + (n << 1) + ch - '0', ch = getchar();
  n = n * sign;
}
template <class T>
void cmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
void cmax(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
int len(const T &c) {
  return (int)c.size();
}
template <class T>
int len(char c[]) {
  return (int)strlen(c);
}
long stoi(string s) {
  long n = 0;
  for (int i(0), _n(len(s)); i < _n; ++i) n = n * 10 + (s[i] - 48);
  return n;
}
int main() {
  ios_base::sync_with_stdio(false);
  long long w, h, n, p, dis;
  multiset<long long> a, b;
  set<long long> a1, b1;
  set<long long>::iterator it, itt;
  cin >> w >> h >> n;
  a1.insert(0);
  a1.insert(w);
  b1.insert(0);
  b1.insert(h);
  a.insert(w);
  b.insert(h);
  string s;
  for (int i(0), _n(n); i < _n; ++i) {
    cin >> s >> p;
    if (s == "V") {
      it = a1.lower_bound(p);
      it--;
      itt = it;
      it++;
      dis = *it - *itt;
      a.erase(a.find(dis));
      a.insert(p - *itt);
      a.insert(*it - p);
      a1.insert(p);
    } else {
      it = b1.lower_bound(p);
      it--;
      itt = it;
      it++;
      dis = *it - *itt;
      b.erase(b.find(dis));
      b.insert(p - *itt);
      b.insert(*it - p);
      b1.insert(p);
    }
    cout << (long long)((*a.rbegin()) * (*b.rbegin())) << endl;
  }
  return 0;
}
