1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#include <bits/stdc++.h>

using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C&a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C&a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<endl;}
template<class TH, class...TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while (*sdbg!=',')cerr<<*sdbg++;cerr<<'='<<h<<",";_dbg(sdbg+1, a...);
}

template<class T> ostream& operator<<(ostream &os, vector<T> V) {
  os<<"[";for(auto vv:V)os<<vv<<","; os<<"]";
  return os;
}
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) {
  os<<"("<<P.first<<","<<P.second<<")";
  return os;
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

const int MaxN = 1024;

vector<int> adjNope[MaxN], adjMust[MaxN];
vector<int> twoDir[MaxN];
bool mustAncestor[MaxN][MaxN], cantAncestor[MaxN][MaxN];
int N, M;
int numMustUp[MaxN], numCantDown[MaxN];
int parent[MaxN];

bool visited[MaxN];
vector<int> allVisited;

void dfs(int v) {
  visited[v] = true;
  allVisited.push_back(v);
  for (int s : twoDir[v]) {
    if (!visited[s]) { dfs(s); }
  }
}


void fail() {
  cout << "NIE\n";
  exit(0);
}


bool inSet[MaxN];

int findRoot(const vector<int> &verts) {
  for (int v : verts) { inSet[v] = true; numMustUp[v] = numCantDown[v] = 0; }
  for (int v : verts) {
    for (int s : adjMust[v]) {
      if (inSet[s]) { numMustUp[v]++; }
    }
    for (int s : adjNope[v]) {
      if (inSet[s]) { numCantDown[s]++; }
    }
  }
  for (int v : verts) { inSet[v] = false; }

  int foundVert = -1;
  for (int v : verts) {
    if (numMustUp[v] == 0 && numCantDown[v] == 0) { foundVert = v; break; }
  }
  if (foundVert == -1) { fail(); }
  return foundVert;
}

int solve(vector<int> verts) {
  int foundVert = findRoot(verts);
  for (int v : verts) { visited[v] = false; }

  visited[foundVert] = true;

  for (int v : verts) {
    if (!visited[v]) {
      allVisited.clear();
      dfs(v);
      parent[solve(allVisited)] = foundVert;
    }
  }
  return foundVert;
}


int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(12);
  cerr << fixed << setprecision(6);

  cin >> N >> M;
  for (int i = 0; i < M; i++) {
    int u, v;
    char type;
    cin >> u >> v >> type;

    if (type == 'T') {
      mustAncestor[u][v] = true;
      numMustUp[u]++;
      twoDir[u].PB(v);
      twoDir[v].PB(u);
      adjMust[u].push_back(v);
    } else {
      cantAncestor[u][v] = true;
      numCantDown[v]++;
      adjNope[u].push_back(v);
    }
  }

  vector<int> verts(N);
  iota(ALL(verts), 1);
  solve(verts);

  for (int i = 1; i <= N; i++) {
    cout << parent[i] << "\n";
  }
}