#include <bits/stdc++.h>
#pragma GCC optimize("inline,Ofast", 3)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
int x[200200], y[200200];
map<int, int> mp;
int main() {
  int n, q;
  cin >> n >> q;
  mp[0] = mp[n + 1] = q;
  for (int i = q - 1; i >= 0; i--) {
    char c;
    cin >> x[i] >> y[i] >> c;
    if (c == 'U') {
      map<int, int>::iterator it;
      it = mp.lower_bound(x[i]);
      int u = x[i];
      if (it->first == x[i]) {
        cout << '0' << endl;
        continue;
      } else {
        int ans;
        ans = y[i] - y[it->second];
        cout << ans << endl;
        y[i] = y[it->second];
      }
      mp[u] = i;
    } else {
      map<int, int>::iterator it;
      it = mp.lower_bound(x[i]);
      int u = x[i];
      if (it->first == x[i]) {
        cout << '0' << endl;
        continue;
      } else {
        it--;
        int ans;
        ans = x[i] - x[it->second];
        cout << ans << endl;
        x[i] = x[it->second];
      }
      mp[u] = i;
    }
  }
}
