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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
/*****************
 * Adam Pawloski *
 *****************/

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef set<int> SI;
typedef pair<int, int> PII;
typedef vector<pair<int, int> > VPII;

const int INF = 1000000001;
const int EPS = 1e-9;
const int MOD = 1000000007;

//813437586

#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define VAR(v, n) auto v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)

#define MP make_pair
#define PB push_back
#define ST first
#define ND second


/*************************** END OF TEMPLATE ***************************/



const int maxn = 100;

int n;

int T[maxn][maxn];
int N[maxn][maxn];
int countT[maxn];

int f[maxn];


bool checkF()
{

	//if(f[1] == 0 && f[2] == 1 && f[3] == 1 && f[4] == 2)
		//cout << "jest\n";
	/*
	int root = -1;
	for(int i = 1; i <= n; i++)
		if(f[i] == 0)
		{
			if(root == -1)
				root = i;
			else
			{
				//if(f[1] == 0 && f[2] == 1 && f[3] == 1 && f[4] == 2)
					//cout << "two roots";
				return false;
			}
		}
	if(root == -1)
	{
		//if(f[1] == 0 && f[2] == 1 && f[3] == 1 && f[4] == 2)
			//cout << "no root";
		return false;
	}
	*/

	for(int i = 1; i <= n; i++)
	{
		int pos = i;
		int c = 0;
		int cT = 0;
		while(1)
		{
			if(f[pos] == pos)
				break;
			pos = f[pos];
			if(T[i][pos])
				cT++;
			if(N[i][pos])
			{
				//if(f[1] == 0 && f[2] == 1 && f[3] == 1 && f[4] == 2)
					//cout << "N present";
				return false;
			}
			c++;
			if(c > n+3)
			{
				//if(f[1] == 0 && f[2] == 1 && f[3] == 1 && f[4] == 2)
					//cout << "too long";
				return false;
			}
		}
		if(cT < countT[i])
		{
			//if(f[1] == 0 && f[2] == 1 && f[3] == 1 && f[4] == 2)
				//cout << "missing T";
			return false;
		}
	}

	//if(f[1] == 0 && f[2] == 1 && f[3] == 1 && f[4] == 2)
		//cout <<"its good";
	for(int i = 1; i <= n; i++)
		cout << f[i] << '\n';
	return true;
}
/*
void coutf()
{
	for(int i = 1; i <= n; i++)
		cout << f[i] << ' ';
	cout << endl;
	int a;
	cin >> a;

}
*/

bool makefO(int a)
{
	//cout << "O " << a << endl;
	//coutf();
	for(int i = 1; i <= n; i++)
		if(i != a)
		{
			f[a] = i;
			if(a<n)
			{
				if(makefO(a+1))
					return true;
			}
			else if(checkF())
				return true;
		}
	return false;
}

bool makefW(int a)
{
	//cout << "W " << a << endl;
	//coutf();
	f[a] = 0;
	if(a < n)
	{
		if(makefO(a+1))
			return true;
	}
	else if(checkF())
		return true;
	if(a < n)
	{
		for(int i = 1; i <= n; i++)
			if(i != a)
			{
				f[a] = i;
				if(a<n)
				{
					if(makefW(a+1))
						return true;
				}
				else if(checkF())
					return true;
			}
	}
	return false;
}





int main()
{
	ios_base::sync_with_stdio(false);
	int m;
	cin >> n >> m;

	while(m--)
	{
		int a, b;
		char c;
		cin >> a >> b >> c;

		if(c == 'T')
		{
			T[a][b] = true;
			countT[a]++;
		}
		else
			N[a][b] = true;
	}

	if(!makefW(1))
		cout << "NIE";

	
}