#include<bits/stdc++.h>
using namespace std;
int n,n_;
const int N=3e6+10,M=5e7+10;
int head[N],to[M],nxt[M],cn;
int dfn[N],low[N],sta[N],top,scc,col[N];
bool vis[N];
int ob[400100][2],os[N];
void ad(int u,int v){to[++cn]=v,nxt[cn]=head[u],head[u]=cn;}
void build(int p,int l,int r){
	if(l==r){ob[p][0]=ob[p][1]=l;return;}
	int mid=(l+r)>>1;build(p<<1,l,mid),build(p<<1|1,mid+1,r);
	ob[p][0]=++n_,head[n_]=0,ob[p][1]=++n_,head[n_]=0;
	ad(ob[p<<1][0],ob[p][0]),ad(ob[p<<1|1][0],ob[p][0]);
	ad(ob[p][1],ob[p<<1][1]),ad(ob[p][1],ob[p<<1|1][1]);
}
void dfs(int x){
	dfn[x]=low[x]=++dfn[0],sta[++top]=x,vis[x]=1;
	for(int i=head[x];i;i=nxt[i]){
		int v=to[i];
		if(!dfn[v])dfs(v),low[x]=min(low[x],low[v]);
		else if(vis[v])low[x]=min(low[x],dfn[v]);
	}
	if(dfn[x]==low[x]){
		scc++;
		while(sta[top]!=x)col[sta[top]]=scc,vis[sta[top]]=0,top--;
		col[x]=scc,vis[x]=0,top--;
	}
}
vector<int>fz;
#define pb push_back 
void as(int p,int l,int r,int x,int y){
	if(x<=l&&r<=y){fz.pb(p);return;}
	if(y<l||x>r)return;int mid=(l+r)>>1;
	as(p<<1,l,mid,x,y),as(p<<1|1,mid+1,r,x,y);
}
#define pb push_back
vector<int>g2[N],g[N];
int ru[N];
bool ans[N];
void print(){
	puts("TAK");
	for(int i=1;i<=n*3;i++)printf("%c",ans[col[i]]?'F':'R');
	puts("");
}
void sol(){
	cn=0,top=0,scc=0;
	scanf("%d",&n);n_=n*3;
	for(int i=1;i<=n_;i++)head[i]=0;
	build(1,1,n*3);
	int q;scanf("%d",&q);
	for(int i=1,a,b,c,d;i<=q;i++){
		scanf("%d%d%d%d",&a,&b,&c,&d);vector<int>p1,p2;
		fz.clear(),as(1,1,n*3,a,b),p1=fz;
		fz.clear(),as(1,1,n*3,c,d),p2=fz;
		head[++n_]=0;
		for(int x:p1)ad(ob[x][0],n_);
		for(int x:p2)ad(n_,ob[x][1]);
	}
	for(int i=0;i<=n_;i++)dfn[i]=low[i]=0;
	for(int i=1;i<=n_;i++)if(!dfn[i])dfs(i);
	for(int i=1;i<=scc;i++)os[i]=0,g[i].clear(),g2[i].clear(),ru[i]=0,ans[i]=0;
	for(int i=1;i<=n*3;i++)os[col[i]]++;
	for(int i=1;i<=n_;i++)for(int j=head[i];j;j=nxt[j])if(col[i]!=col[to[j]])
	g[col[i]].pb(col[to[j]]),g2[col[to[j]]].pb(col[i]),ru[col[i]]++;
	top=0;
	for(int i=1;i<=scc;i++)if(!ru[i])sta[++top]=i;
	vector<int>nd,S;int A=0;
	while(top){
		int u=sta[top--];
		if(os[u]>=n){S.pb(u);continue;}
		nd.pb(u),A+=os[u];
		for(int v:g2[u])if(!(--ru[v]))sta[++top]=v;
		if(A>=n)break;
	}
	if(A>=n){for(int x:nd)ans[x]=1;print();return;}
	for(int x:S){
		nd.clear();
		for(int i=1;i<=scc;i++)vis[i]=0;queue<int>q;q.push(x),vis[x]=1;
		A=0;
		while(!q.empty()){
			int u=q.front();q.pop();
			nd.pb(u),A+=os[u];
			for(int v:g[u])if(!vis[v])vis[v]=1,q.push(v);
		}
		if(A>=n&&A<=n*2){for(int x:nd)ans[x]=1;print();return;}
	}
	puts("NIE");
}
int main(){
	int T;cin>>T;while(T--)sol();
	return 0;
}