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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
// Krzysztof Małysa
#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,n) for (int i = (a), i##__ = (n); i <= i##__; ++i)
#define REP(i,n) FOR(i,0,n-1)
#define FORD(i,a,n) for (int i = (a), i##__ = (n); i >= i##__; --i)
#define ALL(x) x.begin(), x.end()
#define EB emplace_back
#define ST first
#define ND second
#define OO(A) template<class... T> ostream& operator<<(ostream& os, const A<T...>& x) { return __o(os, ALL(x)); }
#define SZ(x) ((int)x.size())

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<PII> VPII;

template<class A, class B> ostream& operator<<(ostream&, const pair<A, B>&);
template<class I> ostream& __o(ostream&, I, I);
template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& x) { return __o(os, ALL(x)); }
OO(vector) OO(deque) OO(set) OO(multiset) OO(map) OO(multimap)
template<class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p) {
	return os << "(" << p.ST << ", " << p.ND << ")";
}
template<class I> ostream& __o(ostream& os, I a, I b) {
	os << "{";
	for (; a != b;)
		os << *a++, cerr << (a == b ? "" : " ");
	return os << "}";
}
template<class I> ostream& __d(ostream& os, I a, I b) {
	os << "{\n";
	for (I c = a; a != b; ++a)
		os << "  " << distance(c, a) << ": " << *a << endl;
	return os << "}";
}
template<class... T> void __e(T&&... a) {
	int t[] = {(cerr << forward<T>(a), 0)...}; (void)t;
	cerr << endl;
}

template<class A, class B> void mini(A& a, B&& b) { if (b < a) a = b; }
template<class A, class B> void maxi(A& a, B&& b) { if (b > a) a = b; }
int ceil2(int x) { return 1 << (sizeof(x) * 8 - __builtin_clz(x - 1)); }

#ifdef DEBUG
# define D(...) __VA_ARGS__
#else
# define D(...)
#endif

#define LOG(x) D(cerr << #x ": " << x)
#define LOGN(x) D(LOG(x) << endl)
#define DUMP(x) D(cerr << #x ": ", __d(cerr, ALL(x)) << endl)
#define E(...) D(__e(__VA_ARGS__))
#define endl '\n'
constexpr char nl = '\n';
// End of templates

int n;
VPII edges;
VPII forbidden;
VI ans;
VI dsu;

inline int Find(int x) { return (dsu[x] == x ? x : dsu[x] = Find(dsu[x])); }

// Link a to b
inline void Union(int a, int b) {
	dsu[Find(a)] = Find(b);
}

void solve(const VI& nodes, int parent) {
	E("solve(", nodes, ", ", parent, ')');
	if (nodes.empty())
		return;

	vector<bool> is_in_nodes(n + 1);
	vector<bool> can_be_director(n + 1, true);
	for (int x : nodes)
		is_in_nodes[x] = true;

	for (auto&& p : edges)
		if (is_in_nodes[p.ST] && is_in_nodes[p.ND])
			can_be_director[p.ST] = false;
	for (auto&& p : forbidden)
		if (is_in_nodes[p.ST] && is_in_nodes[p.ND])
			can_be_director[p.ND] = false;

	LOGN(is_in_nodes);
	LOGN(can_be_director);
	int director = 0;
	for(int x : nodes)
		if (can_be_director[x]) {
			director = x;
			break;
		}

	LOGN(director);
	if (director == 0) // Not found
		puts("NIE"), exit(0);

	ans[director] = parent;

	dsu.resize(n + 1);
	iota(ALL(dsu), 0);

	for (auto&& p : edges)
		if (is_in_nodes[p.ST] && is_in_nodes[p.ND] && p.ND != director)
			Union(p.ST, p.ND);

	// Distinguish connected components
	VVI G(n + 1);
	for (int x : nodes)
		if (x != director)
			G[Find(x)].EB(x);

	// Remove empty vectors
	for (int i = 0; i < SZ(G);) {
		if (G[i].empty()) {
			G[i].swap(G.back());
			G.pop_back();
			continue;
		}

		++i;
	}
	G.shrink_to_fit(); // Save memory

	// Recursion on connected components
	for (auto&& v : G)
		solve(v, director);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int m;
	cin >> n >> m;
	ans.resize(n + 1);
	while (m--) {
		int a, b;
		char c;
		cin >> a >> b >> c;
		if (c == 'T')
			edges.EB(a, b);
		else
			forbidden.EB(a, b);
	}

	DUMP(edges);
	DUMP(forbidden);

	VI nodes(n);
	iota(ALL(nodes), 1);
	solve(nodes, 0);

	FOR (i, 1, n)
		cout << ans[i] << nl;
	// puts("TAK");

	return 0;
}