#include "bits/stdc++.h"
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
#define assume(expr) ((!!(expr))||(exit((fprintf(stderr,"Assumption Failed: %s on Line %d\n",#expr,__LINE__),-1)),false))
using namespace std;
const int N=2e5+5,M=4e6+6; typedef long long ll;
char ans[N]; int n,m,id[2][N][20],lg2[N],tot,dfn[M],low[M],dfscnt,cnt,siz[M],st[M],ins[M],tp,q[M],h,t,vis[M],num[M],in[M]; vector<int> to[M],fo[M],lis[M],tto[M];
void dfs(int u){
    dfn[u]=low[u]=++dfscnt; st[++tp]=u; ins[u]=1;
    for(int v:to[u]){
        if(!dfn[v]) dfs(v),low[u]=min(low[u],low[v]);
        else if(ins[v]) low[u]=min(low[u],dfn[v]);
    }
    if(low[u]==dfn[u]){
        int z; lis[++cnt].clear(); siz[cnt]=0;
        do{
            z=st[tp--]; ins[z]=0; lis[cnt].push_back(z); siz[cnt]+=z<=n; num[z]=cnt;
        }while(z!=u);
    }
}
void add(int x,int y){
    printf("add(%d,%d)\n",x,y);
    to[x].push_back(y); fo[y].push_back(x);
}
void solve(){
    cin>>n>>m; n*=3;
    lg2[1]=0; For(i,2,n) lg2[i]=lg2[i>>1]+1;
    tot=n; For(o,0,1) For(j,1,lg2[n]) For(i,1,n-(1<<j)+1) id[o][i][j]=++tot;
    For(i,1,n) id[0][i][0]=id[1][i][0]=i;
    For(i,1,tot) to[i].clear(),fo[i].clear(),dfn[i]=ins[i]=0;
    For(j,1,lg2[n]) For(i,1,n-(1<<j)+1){
        add(id[0][i][j-1],id[0][i][j]);
        add(id[0][i+(1<<(j-1))][j-1],id[0][i][j]);
        add(id[1][i][j],id[1][i][j-1]);
        add(id[1][i][j],id[1][i+(1<<(j-1))][j-1]);
    }
    For(i,1,m){
        int l1,r1,l2,r2; cin>>l1>>r1>>l2>>r2;
        int k1=lg2[r1-l1+1], k2=lg2[r2-l2+1];
        int u1=id[0][l1][k1],u2=id[0][r1-(1<<k1)+1][k1], v1=id[1][l2][k2],v2=id[1][r2-(1<<k2)+1][k2];
        add(u1,v1),add(u1,v2),add(u2,v1),add(u2,v2);
    }
    dfscnt=cnt=tp=0;
    For(i,1,tot) if(!dfn[i]) dfs(i);
    int Big=0; For(i,1,cnt) if(siz[i]>=n/3) { Big=i; break; }
    if(!Big){
        cerr<<"Not Big\n";
        ans[n+1]='\0'; For(i,1,n) ans[i]='F';
        For(i,1,cnt) tto[i].clear(),in[i]=0;
        For(u,1,tot) for(int v:to[u]) if(num[u]!=num[v]) tto[num[u]].push_back(num[v]),in[num[v]]++;
        h=t=0; For(i,1,cnt) if(!in[i]) q[t++]=i;
        while(h<t){
            int u=q[h++]; for(int v:tto[u]) if(!--in[v]) q[t++]=v;
        }
        assume(t==cnt);
        int s=0;
        For(i,0,t-1){
            int o=q[i];
            for(int u:lis[o]) if(u<=n) ans[u]='R';
            s+=siz[o]; if(s>=n/3) break;
        }
        cout<<"TAK\n";
        cout<<ans+1<<'\n';
    }
    else{
        For(i,1,tot) vis[i]=0;
        int s=0; h=t=0; for(int u:lis[Big]) vis[u]=1,q[t++]=u,s+=u<=n;
        while(h<t){
            int u=q[h++];
            for(int v:to[u]) if(!vis[v]) vis[v]=1,q[t++]=v,s+=v<=n;
        }
        if(s<=n/3*2){
            cout<<"TAK\n";
            For(i,1,n) cout<<(vis[i]?"F":"R");; cout<<'\n';
            return;
        }
        For(i,1,tot) vis[i]=0;
        s=0; h=t=0; for(int u:lis[Big]) vis[u]=1,q[t++]=u,s+=u<=n;
        while(h<t){
            int u=q[h++];
            for(int v:fo[u]) if(!vis[v]) vis[v]=1,q[t++]=v,s+=v<=n;
        }
        if(s<=n/3*2){
            cout<<"TAK\n";
            For(i,1,n) cout<<(vis[i]?"R":"F");; cout<<'\n';
            return;
        }
        cout<<"NIE\n";
    }
}
signed main(){
    int T; cin>>T; while(T--) solve();
    cerr<<"Time = "<<clock()<<" ms"<<endl;
    return 0;
}

// START TYPING IF YOU DON'T KNOW WHAT TO DO
// STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
// CONTINUE, NON-STOPPING, FOR CHARLIEVINNIE