#include <bits/stdc++.h>
const int mod = 1000000007;
const int gmod = 5;
const int inf = 1039074182;
const double eps = 1e-9;
const long long llinf = 1LL * inf * inf;
template <typename T1, typename T2>
inline void chmin(T1 &x, T2 b) {
  if (b < x) x = b;
}
template <typename T1, typename T2>
inline void chmax(T1 &x, T2 b) {
  if (b > x) x = b;
}
inline void chadd(int &x, int b) {
  x += b - mod;
  x += (x >> 31 & mod);
}
template <typename T1, typename T2>
inline void chadd(T1 &x, T2 b) {
  x += b;
  if (x >= mod) x -= mod;
}
template <typename T1, typename T2>
inline void chmul(T1 &x, T2 b) {
  x = 1LL * x * b % mod;
}
template <typename T1, typename T2>
inline void chmod(T1 &x, T2 b) {
  x %= b, x += b;
  if (x >= b) x -= b;
}
template <typename T>
inline T mabs(T x) {
  return (x < 0 ? -x : x);
}
using namespace std;
template <typename T>
ostream &operator<<(ostream &cout, vector<T> vec) {
  cout << "{";
  for (int i = 0; i < (int)vec.size(); i++) {
    cout << vec[i];
    if (i != (int)vec.size() - 1) cout << ',';
  }
  cout << "}";
  return cout;
}
template <typename T>
void operator*=(vector<T> &vec, int k) {
  for (auto &x : vec) x *= k;
}
template <typename T>
void operator-=(vector<T> &a, const vector<T> &b) {
  assert(a.size() == b.size());
  for (size_t it = 0; it < a.size(); it++) {
    a[it] -= b[it];
  }
}
template <typename T>
vector<T> operator*(const vector<T> &vec, int k) {
  vector<T> res(vec);
  res *= k;
  return res;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &cout, pair<T1, T2> p) {
  cout << "(" << p.first << ',' << p.second << ")";
  return cout;
}
template <typename T, typename T2>
ostream &operator<<(ostream &cout, set<T, T2> s) {
  vector<T> t;
  for (auto x : s) t.push_back(x);
  cout << t;
  return cout;
}
template <typename T, typename T2>
ostream &operator<<(ostream &cout, multiset<T, T2> s) {
  vector<T> t;
  for (auto x : s) t.push_back(x);
  cout << t;
  return cout;
}
template <typename T>
ostream &operator<<(ostream &cout, queue<T> q) {
  vector<T> t;
  while (q.size()) {
    t.push_back(q.front());
    q.pop();
  }
  cout << t;
  return cout;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &cout, map<T1, T2, T3> m) {
  for (auto &x : m) {
    cout << "Key: " << x.first << ' ' << "Value: " << x.second << endl;
  }
  return cout;
}
template <typename T>
T operator*(vector<T> v1, vector<T> v2) {
  assert(v1.size() == v2.size());
  int n = v1.size();
  T res = 0;
  for (int i = 0; i < n; i++) {
    res += v1[i] * v2[i];
  }
  return res;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(pair<T1, T2> x, pair<T1, T2> y) {
  return make_pair(x.first + y.first, x.second + y.second);
}
template <typename T1, typename T2>
void operator+=(pair<T1, T2> &x, pair<T1, T2> y) {
  x.first += y.first;
  x.second += y.second;
}
template <typename T1, typename T2>
pair<T1, T2> operator-(pair<T1, T2> x) {
  return make_pair(-x.first, -x.second);
}
template <typename T>
vector<vector<T>> operator~(vector<vector<T>> vec) {
  vector<vector<T>> v;
  int n = vec.size(), m = vec[0].size();
  v.resize(m);
  for (int i = 0; i < m; i++) {
    v[i].resize(n);
  }
  for (int i = 0; i < m; i++) {
    for (int j = 0; j < n; j++) {
      v[i][j] = vec[j][i];
    }
  }
  return v;
}
void print0x(int x) {
  std::vector<int> vec;
  while (x) {
    vec.push_back(x & 1);
    x >>= 1;
  }
  std::reverse(vec.begin(), vec.end());
  for (int i = 0; i < (int)vec.size(); i++) {
    std::cout << vec[i];
  }
  std::cout << ' ';
}
template <typename T>
void print0x(T x, int len) {
  std::vector<int> vec;
  while (x) {
    vec.push_back(x & 1);
    x >>= 1;
  }
  reverse(vec.begin(), vec.end());
  for (int i = vec.size(); i < len; i++) {
    putchar('0');
  }
  for (int i = 0; i < vec.size(); i++) {
    std::cout << vec[i];
  }
  std::cout << ' ';
}
using namespace std;
int n;
int q;
tuple<int, int, char> data[200005];
struct SegmentTreeMaxUpdate {
  int data[524288 + 5];
  int tag[524288 + 5];
  int nn;
  int size() { return nn; }
  void init(int size) {
    nn = 1;
    while (nn < size) {
      nn <<= 1;
    }
    for (int i = 0; i <= nn * 2; i++) {
      data[i] = -1;
      tag[i] = -1;
    }
  }
  void pushdown(int x) {
    if (x >= nn) return;
    data[x * 2] = max(data[x * 2], tag[x]);
    data[x * 2 + 1] = max(data[x * 2 + 1], tag[x]);
    tag[x * 2] = max(tag[x * 2], tag[x]);
    tag[x * 2 + 1] = max(tag[x * 2 + 1], tag[x]);
    tag[x] = -1;
  }
  void update(int ql, int qr, int value) { update(1, 0, nn, ql, qr, value); }
  void update(int pos, int value) { update(pos, pos + 1, value); }
  void update(int x, int l, int r, int ql, int qr, int value) {
    if (l >= qr || r <= ql) return;
    pushdown(x);
    if (l >= ql && r <= qr) {
      data[x] = max(data[x], value);
      tag[x] = max(tag[x], value);
      return;
    }
    update(x * 2, l, l + r >> 1, ql, qr, value);
    update(x * 2 + 1, l + r >> 1, r, ql, qr, value);
    data[x] = max(data[x * 2], data[x * 2 + 1]);
  }
  inline int query(int ql, int qr) { return query(1, 0, nn, ql, qr); }
  inline int query(int pos) { return query(pos, pos + 1); }
  int query(int x, int l, int r, int ql, int qr) {
    if (l >= qr || r <= ql) return -1;
    pushdown(x);
    if (l >= ql && r <= qr) return data[x];
    return max(query(x * 2, l, (l + r) >> 1, ql, qr),
               query(x * 2 + 1, (l + r) >> 1, r, ql, qr));
  }
} sgtR, sgtC;
vector<int> lshRow, lshCol;
int main() {
  cin >> n >> q;
  sgtR.init(q);
  sgtC.init(q);
  for (int i = 0; i < q; i++) {
    int x, y;
    char c;
    scanf("%d %d %c", &x, &y, &c);
    swap(x, y);
    x--;
    y--;
    lshRow.push_back(x);
    lshCol.push_back(y);
    data[i] = make_tuple(x, y, c);
  }
  sort(lshRow.begin(), lshRow.end());
  sort(lshCol.begin(), lshCol.end());
  lshRow.erase(unique(lshRow.begin(), lshRow.end()), lshRow.end());
  lshCol.erase(unique(lshCol.begin(), lshCol.end()), lshCol.end());
  for (int i = 0; i < q; i++) {
    int x, y;
    char c;
    tie(x, y, c) = data[i];
    x = lower_bound(lshRow.begin(), lshRow.end(), x) - lshRow.begin();
    y = lower_bound(lshCol.begin(), lshCol.end(), y) - lshCol.begin();
    if (c == 'U') {
      int row = sgtC.query(y);
      printf("%d\n", lshRow[x] - (row == -1 ? -1 : lshRow[row]));
      sgtR.update(row, x + 1, y);
      sgtC.update(y, x);
    } else {
      int col = sgtR.query(x);
      printf("%d\n", lshCol[y] - (col == -1 ? -1 : lshCol[col]));
      sgtC.update(col, y + 1, x);
      sgtR.update(x, y);
    }
  }
  return 0;
}
