Problem: You need to find a binary tree of size n that satisfies a given set of c constraints. Suppose that the nodes of the unknown binary tree are labeled using a pre-order traversal starting with 1. For the i-th constraint you are given two labels, ai and bi and a direction, left or right. In case of left direction, bi is an element of the subtree rooted at ai's left child. Similarly in the case of right direction bi is an element of the subtree rooted at ai's right child.

Input

The first line of input contains two integers n and c. The next c lines contain 2 integers ai, bi (1 ≤ ai, bi ≤ n) and either "LEFT" or "RIGHT" denoting whether b is in the subtree rooted at ai's left child or in the subtree rooted at ai's right child.

The problem consists of multiple subproblems. The subproblems have different constraints on the input. You will get some score for the correct submission of the subproblem. The description of the subproblems follows.

  * In subproblem D1 (9 points), the constraints 1 ≤ n ≤ 100, 1 ≤ c ≤ 50 will hold. 
  * In subproblem D2 (8 points), the constraints 1 ≤ n ≤ 1000000, 1 ≤ c ≤ 100000 will hold. 

Output

Output will be on a single line.

Any binary tree that satisfies the constraints will be accepted. The tree's nodes should be printed out as n space separated labels representing an in-order traversal, using the pre-order numbers as labels of vertices.

If there are no trees that satisfy the constraints, print "IMPOSSIBLE" (without quotes).

Examples

Input

3 2
1 2 LEFT
1 3 RIGHT


Output

2 1 3


Input

3 2
1 2 RIGHT
1 3 LEFT


Output

IMPOSSIBLE

Note

Consider the first sample test. We need to find a tree with 3 nodes that satisfies the following two constraints. The node labeled 2 with pre-order traversal should be in the left subtree of the node labeled 1 with pre-order traversal; the node labeled 3 with pre-order traversal should be in the right subtree of the node labeled 1. There is only one tree with three nodes that satisfies these constraints and its in-order traversal is (2, 1, 3).

Pre-order is the "root – left subtree – right subtree" order. In-order is the "left subtree – root – right subtree" order.

For other information regarding in-order and pre-order, see <http://en.wikipedia.org/wiki/Tree_traversal>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MN = 1100100;
template <int S>
struct RangeMaxQuery {
  static const int N = 1 << S;
  static const long long INF = 1LL << 62;
  long long seg[2 * N];
  void init() { fill_n(seg, 2 * N, +INF); }
  void init(int n, long long x[]) {
    init();
    for (int i = 0; i < n; i++) {
      seg[i + S] = x[i];
    }
    for (int i = N - 1; i >= 1; i--) {
      seg[i] = max(seg[i * 2], seg[i * 2 + 1]);
    }
  }
  void set(int i, long long x) {
    i += N;
    seg[i] = x;
    while (i) {
      i /= 2;
      seg[i] = max(seg[i * 2], seg[i * 2 + 1]);
    }
  }
  long long get(int a, int b, int k = 1, int l = 0, int r = N) {
    if (r <= a || b <= l) return -INF;
    if (a <= l && r <= b) return seg[k];
    int md = (l + r) / 2;
    long long dl = get(a, b, k * 2, l, md);
    long long dr = get(a, b, k * 2 + 1, md, r);
    return max(dl, dr);
  }
};
RangeMaxQuery<20> rmq;
vector<int> g[MN][2];
vector<int> res;
int lm[MN];
bool used[MN] = {};
bool rf = true;
int ma[MN];
void solve(int a, int r) {
  if (a == r) return;
  if (r < rmq.get(a, a + 1)) {
    rf = false;
    return;
  }
  if (used[a]) {
    rf = false;
    return;
  }
  used[a] = true;
  if (g[a][0].size()) {
    solve(a + 1, lm[a]);
    res.push_back(a);
    solve(lm[a], r);
  } else {
    res.push_back(a);
    solve(a + 1, r);
  }
}
vector<tuple<int, int, int> > e;
int main() {
  rmq.init();
  int n, c;
  cin >> n >> c;
  for (int i = 0; i < c; i++) {
    int a, b;
    string s;
    cin >> a >> b >> s;
    a--;
    b--;
    if (b <= a) {
      cout << "IMPOSSIBLE" << endl;
      return 0;
    }
    if (s == "LEFT") {
      e.push_back(tuple<int, int, int>(a, b, 0));
    } else {
      e.push_back(tuple<int, int, int>(a, b, 1));
    }
  }
  sort(e.begin(), e.end());
  e.erase(unique(e.begin(), e.end()), e.end());
  for (tuple<int, int, int> t : e) {
    int a, b, c;
    tie(a, b, c) = t;
    g[a][c].push_back(b);
  }
  for (int i = n - 1; i >= 0; i--) {
    lm[i] = i + 1;
    if (g[i][0].size()) {
      lm[i] = rmq.get(i + 1, g[i][0].back() + 1);
    }
    int u = lm[i];
    if (g[i][1].size()) {
      if (lm[i] > g[i][1].front()) {
        cout << "IMPOSSIBLE" << endl;
        return 0;
      }
      u = max<int>(u, rmq.get(i + 1, g[i][1].back() + 1));
    }
    rmq.set(i, u);
  }
  solve(0, n);
  if (!rf) {
    cout << "IMPOSSIBLE" << endl;
    return 0;
  }
  for (int d : res) {
    printf("%d ", d + 1);
  }
  printf("\n");
  return 0;
}