#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

#define N 500007

int col[N], row[N];

int main() {
    int n = rd(), m = rd();
    if (n == 1) {rep(i, 1, m) puts("1"); return 0;}
    rep(i, 1, n) col[i] = row[i] = (i & 1);
    int c = n, r = n;
    auto workr = [&]() {
        int x = rd();
        if (x == 1) {row[1] == row[2] ? ++r : --r;}
        else if (x == n) {row[n] == row[n - 1] ? ++r : --r;}
        else if (row[x - 1] == row[x + 1]) {row[x] == row[x - 1] ? r += 2 : r -= 2;}
        row[x] ^= 1;
    };
    auto workc = [&]() {
        int x = rd();
        if (x == 1) {col[1] == col[2] ? ++c : --c;}
        else if (x == n) {col[n] == col[n - 1] ? ++c : --c;}
        else if (col[x - 1] == col[x + 1]) {col[x] == col[x - 1] ? c += 2 : c -= 2;}
        col[x] ^= 1;
    };
    rep(i, 1, m) {
        char ch = getchar();
        while (!isalpha(ch)) ch = getchar();
        ch == 'R' ? workr() : workc();
        printf("%lld\n", 1ll * r * c);
    }
    return 0;
}