#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
vector<ll> vec[1000010];
ll t,n,q,head[1000010],cnt=0,tot=0;
ll dfn[1000010],low[1000010],tott=0,blg[1000010],cntt=0,st[1000010],top=0;
ll id[1000010],mp[1000010],num=0,siz[1000010],in[1000010];
bl ck[1000010];
struct node{
	ll nxt,to;
}e[5000050];
void add(ll u,ll v){
//	pf("%lld %lld\n",u,v);
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
struct seg{
	#define LC lc[x]
	#define RC rc[x]
	ll rt,lc[400040],rc[400040];
	il void pushup(ll x,bl o){
		if(!o){
			add(LC,x);
			add(RC,x);
		}
		else{
			add(x,LC);
			add(x,RC);
		}
	}
	void build(ll &x,ll l,ll r,bl o){
		x=++tot;
		if(l==r){
			if(!o) add(l,x);
			else add(x,l);
			return;
		}
		ll mid=(l+r)>>1;
		build(LC,l,mid,o);
		build(RC,mid+1,r,o);
		pushup(x,o);
	}
	void mdf(ll x,ll l,ll r,ll ql,ll qr,ll v,bl o){
		if(ql<=l&&r<=qr){
			if(!o) add(x,v);
			else add(v,x);
			return;
		}
		ll mid=(l+r)>>1;
		if(ql<=mid) mdf(LC,l,mid,ql,qr,v,o);
		if(mid<qr) mdf(RC,mid+1,r,ql,qr,v,o);
	}
	void CLR(ll x,ll l,ll r){
		if(l==r) return;
		ll mid=(l+r)>>1;
		CLR(LC,l,mid);
		CLR(RC,mid+1,r);
		LC=RC=0;
	}
	void clr(){
		CLR(rt,1,3*n);
		rt=0;
	}
}up,dwn;
void tarjan(ll u){
	dfn[u]=low[u]=++tott;
	st[++top]=u;
	ck[u]=1;
	go(u){
		ll v=e[i].to;
		if(!dfn[v]){
			tarjan(v);
			low[u]=min(low[u],low[v]);
		}
		else if(ck[v]) low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]){
		blg[u]=++cntt;
		ck[u]=0;
		while(st[top]!=u){
			blg[st[top]]=cntt;
			ck[st[top]]=0;
			top--;
		}
		top--;
	}
}
void topo(){
	queue<ll> Q;
	fr(i,1,cntt) if(!in[i]) Q.push(i);
	while(!Q.empty()){
		ll u=Q.front();
		Q.pop();
		id[++num]=u;
		fr(i,0,(ll)vec[u].size()-1){
			ll v=vec[u][i];
			in[v]--;
			if(!in[v]) Q.push(v);
		}
	}
}
void dfs(ll u){
	ck[u]=1;
	fr(i,0,(ll)vec[u].size()-1){
		ll v=vec[u][i];
		if(!ck[v]) dfs(v);
	}
}
void clr(){
	fr(i,1,tot) head[i]=dfn[i]=low[i]=blg[i]=ck[i]=0;
	fr(i,1,cntt){
		vec[i].clear();
		in[i]=siz[i]=0;
	}
	cnt=tot=tott=cntt=top=num=0;
	up.clr();
	dwn.clr();
}
int main(){
	t=read();
	while(t--){
		n=read();
		q=read();
		tot=3*n;
		up.build(up.rt,1,3*n,0);
		dwn.build(dwn.rt,1,3*n,1);
		while(q--){
			ll l1=read(),r1=read(),l2=read(),r2=read();
			tot++;
			up.mdf(up.rt,1,3*n,l1,r1,tot,0);
			dwn.mdf(dwn.rt,1,3*n,l2,r2,tot,1);
		}
		assert(tot<=1000000);
		assert(cnt<=5000000);
		fr(i,1,tot) if(!dfn[i]) tarjan(i);
		fr(u,1,tot){
			if(u<=3*n) siz[blg[u]]++;
			go(u){
				ll v=e[i].to;
				if(blg[u]==blg[v]) continue;
				vec[blg[u]].push_back(blg[v]);
				in[blg[v]]++;
			}
		}
		topo();
		ll now=0,pos=0;
		fr(i,1,cntt){
			now+=siz[i];
			if(now>=n&&now<=2*n) pos=i;
		}
		if(pos){
			fr(i,1,cntt) mp[id[i]]=i;
			pf("TAK\n");
			fr(i,1,3*n){
				if(mp[blg[i]]<=pos) pc('R');
				else pc('F');
			}
			enter;
		}
		else{
			fr(i,1,cntt) if(siz[i]>=n) pos=i;
			assert(pos&&siz[pos]>=n);
			fr(i,1,cntt) ck[i]=0;
			dfs(pos);
			ll sum=0;
			fr(i,1,cntt) if(ck[i]) sum+=siz[i];
			assert(sum>=n);
			if(sum>2*n) pf("NIE\n");
			else{
				pf("TAK\n");
				fr(i,1,3*n){
					if(ck[blg[i]]) pc('R');
					else pc('F');
				}
				enter;
			}
		}
		clr();
	}
}