#include <bits/stdc++.h>

#define FOR(i, x, n) for(int i = x; i < n; i++)
#define F0R(i, n) FOR(i, 0, n)

using namespace std;

typedef long long LL;

const int N = 12;

LL n, q;
int up[N], dn[N], rt[N], lf[N];

int main() {
    cin >> n >> q;
    LL sat = n, sot = n;

    while(q--) {
        string tp; cin >> tp;
        int x; cin >> x; x--;

        if (tp[0] == 'R') {
            sat += ((x ? (up[x] ? +1 : -1) : 0) + (x < n - 1 ? (dn[x] ? +1 : -1) : 0));
            up[x] ^= 1;
            dn[x] ^= 1;
        }

        else {
            sot += (x ? (lf[x] ? +1 : -1) : 0) + (x < n - 1 ? (rt[x] ? +1 : -1) : 0);
            lf[x] ^= 1;
            rt[x] ^= 1;
        }

        cout << sat * sot << endl;
    }
}