#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int w[1001][1001]={{0}},n,m,b[1001][2],i,q[100000],qi,mo,answer;
bool used[1001]={0};
void bfs(int x);
int main()
{
	freopen ("messagez.in","r",stdin);
	freopen ("messagez.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int p=0;p<m;p++)
	{
		int c,d;
		scanf("%d%d",&c,&d);
		w[c][d]=1;
		b[c][0]++;
		b[d][1]++;
	}
	for ( i=1;i<=n;i++)
	{
		if (b[i][0]==0||b[i][1]==0)
		{
			cout<<'F'<<endl;
		}
		else
		{
			q[0]=i;
			qi=0;
			mo=0;
			answer=0;
			for (int i=0;i<=n;i++)
			{
				used[i]=0;
			}
			while (qi<=mo)
			{
				bfs(qi);
				if (answer)
				{
					cout<<"T"<<endl;
					break;
				}
				qi++;
			}
			if (answer==0)
			{
				cout<<'F'<<endl;
			}
		}
	}
}
void bfs(int x)
{
	for (int j=1;j<=n;j++)
	{
		if (j==q[x])			
			continue;
		if (!used[j])
		{
			if (w[q[x]][j])
			{
				mo++;
				if (j==i)
				{
					answer=1;
					return;
				}
				q[mo]=j;
				used[j]=1;
			}
		}
	}
}