2 0
 100000 0
 8 9
1 2
2 3
3 4
4 1
5 6
6 7
7 8
8 5
6 8
 2 1
1 2
 11 9
5 9
8 5
11 3
11 1
3 4
7 11
3 1
11 2
7 2
 7 9
7 3
7 4
1 2
2 3
3 1
3 4
4 5
5 6
6 4
 7 5
5 4
7 3
7 1
6 7
3 1
 7 8
1 2
2 3
3 4
4 1
3 5
5 6
6 7
7 3
 6 9
1 2
2 3
1 4
4 2
5 2
5 3
4 5
6 4
6 5
 7 9
1 2
2 4
4 3
3 1
2 3
4 5
5 6
6 7
7 4
 1 0
 6 7
1 2
2 3
3 1
3 4
4 5
5 6
6 4
 4 5
1 2
2 3
3 4
4 1
1 3
 100000 3
99998 99999
99999 100000
100000 99998

0

 0

 4
1 2 3 4 
 0

 6
3 4 6 7 8 9 
 9
1 2 3 4 5 6 7 8 9 
 3
2 3 5 
 8
1 2 3 4 5 6 7 8 
 0

 4
6 7 8 9 
 0

 6
1 2 3 5 6 7 
 0

 3
1 2 3 

#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int N = 1e6 + 10;
long long mod = 1e9 + 7;
const int base = 131;
const double pi = acos(-1);
const double eps = 1e-8;
inline long long ksm(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod, b >>= 1;
  }
  return ans;
}
long long vis[N], num[N];
long long n, m, k, x, y, z;
long long cx, cy, cnt, ans, sum, flag, t, ff, q;
vector<int> v[N];
unordered_map<int, int> mp;
set<string> st;
int main() {
  int n, q;
  while (~scanf("%d %d", &n, &q)) {
    long long sumr = 0, sumc = 0, sx = 0, sy = 0;
    char ch;
    int x;
    memset(vis, 0, sizeof(vis));
    memset(num, 0, sizeof num);
    for (int i = 1; i <= q; i++) {
      scanf(" %c%d", &ch, &x);
      ans = 0;
      if (ch == 'R' && !vis[x]) {
        vis[x] = 1;
        sumr += x;
        sx++;
        ans = x * n + (1 + n) * n / 2 - (sumc + x * sy);
      } else if (ch == 'C' && !num[x]) {
        num[x] = 1;
        sumc += x;
        sy++;
        ans = x * n + (1 + n) * n / 2 - (sumr + x * sx);
      }
      printf("%lld\n", ans);
    }
  }
  return 0;
}
