#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
class segtree {
    vector<ll> seg; int n, sz; ll id = 0;
public:
    segtree(int n) {
        this->n = n;
        this->sz = 1 << ((int)log2(n - 0.5) + 1);
        seg.resize(sz << 1);
        for (int i = 0; i < sz; i++) seg[i + sz] = id;
    }
    ll op(ll a, ll b) {
        return a + b;
    }
    void init() {
        for (int i = sz - 1; i > 0; i--) {
            seg[i] = op(seg[i << 1], seg[i << 1 | 1]);
        }
    }
    void update(int idx, ll val) {
        seg[sz + idx] = val;
        for (int i = (sz + idx) >> 1; i > 0; i >>= 1) {
            seg[i] = op(seg[i << 1], seg[i << 1 | 1]);
        }
    }
    ll query(int left, int right) {
        ll ret = id;
        for (int l = left + sz, r = right + sz; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) ret = op(ret, seg[l++]);
            if (~r & 1) ret = op(ret, seg[r--]);
        }
        return ret;
    }
    ll& operator[] (const int& idx) {
        return seg[sz + idx];
    }
};
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, q; cin >> n >> q; segtree r(n), c(n);
    for (int i = 0; i < n; i++) r[i] = 1, c[i] = 1;
    r.init(); c.init();
    while (q--) {
        string op; int x; cin >> op >> x; x--;
        if (op == "ROW") {
            if (x > 0) r.update(x - 1, 1 ^ r[x - 1]);
            if (x < n - 1) r.update(x + 1, 1 ^ r[x + 1]);
        } else {
            if (x > 0) c.update(x - 1, 1 ^ c[x - 1]);
            if (x < n - 1) c.update(x + 1, 1 ^ c[x + 1]);
        }
        cout << max(1LL, r.query(0, n - 1) * c.query(0, n - 1)) << '\n';
    }
    return 0;
}