#pragma GCC optimize(2)
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int row[500001];
int col[500001];
void solve()
{
    ll n, q;
    cin >> n >> q;
    for (int i = 1; i <= n;i+=2){
        row[i] = 1;
        col[i] = 1;
    }
    ll r = n;
    ll c = n;
    while(q--){
        string s;
        cin >> s;
        int index;
        cin >> index;
        if(s[0]=='R'){
            if(index==1){
                if(row[index]!=row[index+1]){
                    r--;
                }else{
                    r++;
                }
                row[index] ^= 1;
                ll ans = r * c;
                cout << ans << '\n';
            }else if(index==n){
                if (row[index] != row[index - 1])
                {
                    r--;
                }
                else
                {
                    r++;
                }
                row[index] ^= 1;
                ll ans = r * c;
                cout << ans << '\n';
            }else{
                int dif = 0;
                dif += row[index] != row[index - 1];
                dif += row[index] != row[index + 1];
                row[index] ^= 1;
                r += 2 - 2 * dif;
                ll ans = r * c;
                cout << ans << '\n';
            }
        }else{
            if (index == 1)
            {
                if (col[index] != col[index + 1])
                {
                    c--;
                }
                else
                {
                    c++;
                }
                col[index] ^= 1;
                ll ans = r * c;
                cout << ans << '\n';
            }
            else if (index == n)
            {
                if (col[index] != col[index - 1])
                {
                    c--;
                }
                else
                {
                    c++;
                }
                col[index] ^= 1;
                ll ans = r * c;
                cout << ans << '\n';
            }
            else
            {
                int dif = 0;
                dif += col[index] != col[index - 1];
                dif += col[index] != col[index + 1];
                col[index] ^= 1;
                c += 2 - 2 * dif;
                ll ans = r * c;
                cout << ans << '\n';
            }
        }
    }
}
int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    t = 1;
    while (t--)
    {
        solve();
    }
    return 0;
}