#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
#define LL long long
#define inf 0x3f3f3f3f
using namespace std;
const int MxV=1200002,MxE=50000002,MxN=100002,MxQ=100002;
int n,n2,n3,q,t,edge_t,dfn_t,st_t,rt_t,s,s2,cnt,e_t,Test_num;
int a[MxQ],b[MxQ],c[MxQ],d[MxQ],lson[MxV],rson[MxV],val[MxV],la[MxV],num[MxN],dfn[MxV],low[MxV],rt[MxV],st[MxV],sum[MxV],lae[MxV],from[MxE],deg[MxV];
bool ins[MxV],u[MxV];
vector<int> vec;
vector<int> vec2[MxV];
queue<int> Q,ept;
struct aaa
{
	int to,nx;
}edge[MxE],e[MxE];
template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0' || ch>'9')f|=(ch=='-'),ch=getchar();
	while(ch>='0' && ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	x=f? -x:x;return ;
}
inline void add_edge(int x,int y)
{
	//printf("      ADD %d %d\n",x,y);
	edge[++edge_t]=(aaa){y,la[x]},la[from[edge_t]=x]=edge_t;
}
inline void add_e(int x,int y)
{
	if(x^y)e[++e_t]=(aaa){y,lae[x]},lae[x]=e_t;
}
inline int newnode()
{
	return ++t,la[t]=val[t]=dfn[t]=rt[t]=0,t;
}
inline void build(int k,int l,int r)
{
	//if(l==r)printf("num[%d]=%d\n",l,k);
	if(l==r)return (void)(val[num[l]=k]=1);
	int mid=((l+r)>>1);
	build(lson[k]=newnode(),l,mid),build(rson[k]=newnode(),mid+1,r),add_edge(k,lson[k]),add_edge(k,rson[k]);
}
inline void build2(int k,int l,int r)
{
	if(l==r)return ;
	int mid=((l+r)>>1);
	build2(lson[k]=(l==mid? num[l]:newnode()),l,mid),build2(rson[k]=(mid+1==r? num[r]:newnode()),mid+1,r),add_edge(lson[k],k),add_edge(rson[k],k);
}
inline void add(int k,int l,int r,int l1,int r1,int x)
{
	if(l>=l1 && r<=r1)return add_edge(x,k);
	int mid=((l+r)>>1);
	if(l1<=mid)add(lson[k],l,mid,l1,r1,x);
	if(r1>mid)add(rson[k],mid+1,r,l1,r1,x);
}
inline void add2(int k,int l,int r,int l1,int r1,int x)
{
	if(l>=l1 && r<=r1)return add_edge(k,x);
	int mid=((l+r)>>1);
	if(l1<=mid)add2(lson[k],l,mid,l1,r1,x);
	if(r1>mid)add2(rson[k],mid+1,r,l1,r1,x);
}
inline void Tarjan(int x)
{
	dfn[x]=low[x]=(++dfn_t),ins[st[++st_t]=x]=1;
	for(int i=la[x],v;i;i=edge[i].nx)
	{
		v=edge[i].to;
		if(!dfn[v])Tarjan(v),low[x]=min(low[x],low[v]);
		else if(ins[v])low[x]=min(low[x],dfn[v]);
	}
	if(dfn[x]==low[x])for(sum[++rt_t]=0,vec2[rt_t].clear();st[st_t+1]!=x;--st_t)rt[st[st_t]]=rt_t,sum[rt_t]+=val[st[st_t]],vec2[rt_t].push_back(st[st_t]),ins[st[st_t]]=0;
}
inline void print()
{
	puts("TAK");
	for(int i=1;i<=n3;++i)putchar(u[num[i]]? 'R':'F');
	puts("");
}
inline void solve1()
{
	//cerr<<"solve1\n";
	e_t=0,cnt=n3,Q=ept;
	for(int i=1;i<=t;++i)deg[i]=0;
	for(int i=1;i<=edge_t;++i)add_e(rt[from[i]],rt[edge[i].to]);
	for(int i=1;i<=rt_t;++i)if(!deg[i])Q.push(i),ins[i]=1;else ins[i]=0;
	for(int i=1;i<=t;++i)u[i]=0;
	for(int p;Q.size();)
	{
		p=Q.front(),Q.pop(),cnt-=sum[p];
		//printf("p:%d sum:%d\n",p,sum[p]);
		for(int i=0;i<vec2[p].size();++i)u[vec2[p][i]]=1/*,printf(" u[%d]=1\n",vec2[p][i])*/;
		//for(int i=1;i<=n3;++i)printf("%d%c",u[num[i]],i==n3? '\n':' ');
		if(cnt>=n && cnt<=n2)return print();
		for(int i=0;i<vec2[p].size();++i)for(int i=la[vec2[p][i]],v;i;i=edge[i].nx)if(!(--deg[rt[v=edge[i].to]]) && !ins[rt[v]])Q.push(rt[v]),ins[rt[v]]=1;
	}
}
inline void dfs(int x)
{
	ins[x]=1,cnt+=val[x];
	for(int i=la[x],v;i;i=edge[i].nx)if(!ins[v=edge[i].to])dfs(v);
}
inline void solve2()
{
	//cerr<<"solve2\n";
	for(int i=0;i<vec.size();++i)
	{
		for(int j=1;j<=t;++j)ins[j]=0;
		cnt=0,dfs(vec2[vec[i]][0]);
		if(cnt>=n && cnt<=n2)
		{
			for(int j=1;j<=n3;++j)u[j]=ins[num[j]];
			return print();
		}
	}
	puts("NIE");
}
inline void solve()
{
	read(n),read(q),n2=(n<<1),n3=n*3,edge_t=dfn_t=rt_t=t=0,vec.clear(),build(s=newnode(),1,n3),build2(s2=newnode(),1,n3);
	for(int i=1;i<=q;++i)read(a[i]),read(b[i]),read(c[i]),read(d[i]),add(s,1,n3,a[i],b[i],newnode()),add2(s2,1,n3,c[i],d[i],t);
	for(int i=1;i<=t;++i)if(!dfn[i])Tarjan(i);
	/*for(int i=1;i<=rt_t;++i)
	{
		printf(" %d:",i);
		for(int j=0;j<vec2[i].size();++j)printf("%d%c",vec2[i][j],j+1==vec2[i].size()? '\n':' ');
	}*/
	for(int i=1;i<=rt_t;++i)if(sum[i]>n)vec.push_back(i);
	if(!vec.size())solve1();
	else solve2();
}
int main()
{
	read(Test_num);
	while(Test_num--)solve();
	return 0;
}