#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e6 + 5;
int n, m;
int deg[N];
vector<int> g[N];
string s;
void NO() {
	cout << "conflict\n";
	exit(0);
}
int ans[N];
int id[N];
queue<int> Q;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> m >> n;
	getline(cin, s);
	for (int i = 1; i <= n; i++)
		ans[i] = -1;
	int idx = n;
	while (m--) {
		getline(cin, s);
		if (s.find('>') == s.npos) {
			int res = 0;
			int i = (s[0] == '!');
			while (i < s.size() && isdigit(s[i]))
				res = res * 10 + (s[i] - '0'), i++;
			if (ans[res] != -1 && ans[res] != (s[0] != '!'))
				NO();
			ans[res] = (s[0] != '!');
		}
		else {
			int i = 0;
			vector<int> ve;
			while (1) {
				int res = 0;
				while (i < s.size() && isdigit(s[i]))
					res = res * 10 + (s[i] - '0'), i++;
				ve.push_back(res);
				if (s[i + 1] == '-') {
			 		i += 4;
					break;	
				}
				i++;
			}
			bool flag = 0;
			if (s[i] == '!') {
				flag = 1;
				i++;
			}
			int x = 0;
			while (i < s.size() && isdigit(s[i]))
				x = x * 10 + (s[i] - '0'), i++;
			// cout << "test " << x << " " << flag << endl;
			id[++idx] = x * (flag ? -1 : 1);
			deg[idx] = ve.size();
			for (int u : ve) g[u].push_back(idx);
		}
	}
	for (int i = 1; i <= n; i++)
		if (ans[i] == 1) 
			Q.push(i);
	for (int i = 1; i <= n; i++)
		id[i] = i;
	while (!Q.empty()) {
		int u = Q.front();
		Q.pop();
		int t = abs(id[u]);
		if (ans[t] != -1 && ans[t] != (id[u] > 0)) NO();
		if (ans[t] != -1) continue;
		ans[t] = (id[u] > 0);
		if (id[u] < 0) continue;
		for (int v : g[t]) {
			--deg[v];
			// cout << "fsfsjfhs " << u << " " << t << " " << v << " " << id[v] << " " << deg[v] << endl;
			if (!deg[v]) Q.push(v);
		}
	}
	for (int i = 1; i <= n; i++)
		cout << (ans[i] == 1 ? 'T' : 'F');
	cout << "\n";
}