#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>

using namespace std;
const int N = 1e5 + 10;
const int M = 1e4 + 10;

int head[N], low[N], dfn[N],tmp_ls[N];
bool is[N], vis[N];
int n, m, now = 1, dfs_clock, tmp_js;
struct Node{
	int u, v, nxt;
}E[M];
stack <int> S;

inline int read()
{
	int x = 0; char c = getchar();
	while(c < ‘0‘ || c > ‘9‘)c = getchar();
	while(c >= ‘0‘ && c <= ‘9‘)x = x * 10 + c - ‘0‘, c = getchar();
	return x;
}

inline void add(int u, int v)
{
	E[now].u = u;
	E[now].v = v;
	E[now].nxt = head[u];
	head[u] = now ++;
}

void Tarjan(int x)
{
	low[x] = dfn[x] = ++ dfs_clock;
	S.push(x);
	vis[x] = 1;
	for(int i = head[x]; ~ i; i = E[i].nxt)
	{
		int v = E[i].v;
		if(!dfn[v])
		{
			Tarjan(v);
			low[x] = min(low[x], low[v]);
		}
		else if(vis[v])
			low[x] = min(low[x], dfn[v]);
	}
	if(low[x] == dfn[x])
	{
		tmp_js = 0;
		while(x != S.top())
		{
			tmp_ls[++ tmp_js] = S.top();
			vis[S.top()] = 0;
			S.pop();
		}
		tmp_ls[++ tmp_js] = S.top();
		vis[S.top()] = 0;
		S.pop();
		if(tmp_js > 1)
			for(int i = 1; i <= tmp_js; i ++)
				is[tmp_ls[i]] = 1;
	}
}

int main()
{
	freopen("messagez.in", "r", stdin);
	freopen("messagez.out", "w", stdout);
	n = read();
	m = read();
	for(int i = 1; i <= n; i ++)
		head[i] = -1;
	for(int i = 1; i <= m; i ++)
	{
		int u = read();
		int v = read();
		add(u,v);
	}
	for(int i = 1; i <= n; i ++)
		if(!dfn[i])
			Tarjan(i);
	for(int i = 1; i <= n; i ++)
		if(is[i] == 1)
			printf("T\n");
		else
			printf("F\n");
			
	return 0;
}