#include <bits/stdc++.h>
#define N 1000005
#define pb push_back 
using namespace std;

template <typename T>
inline void read(T &num) {
	T x = 0, ff = 1; char ch = getchar();
	for (; ch > '9' || ch < '0'; ch = getchar()) if (ch == '-') ff = -1;
	for (; ch <= '9' && ch >= '0'; ch = getchar()) x = (x<<3)+(x<<1)+(ch^'0');
	num = x * ff; 
}

int n, Q, tot;
int lc[N], rc[N];
int dfn[N], low[N], stk[N], in[N], col[N], siz[N], top, tme, scc;
vector<int> E[N];

void build(int &p, int l, int r, int tp) {
	if (l == r) return p=l, void();
	p = ++tot; E[p].clear(); 
	int mid = (l+r)>>1;
	build(lc[p],l,mid,tp); build(rc[p],mid+1,r,tp);
	if (!tp) E[lc[p]].pb(p), E[rc[p]].pb(p);
	else E[p].pb(lc[p]), E[p].pb(rc[p]); 
}
void qry(int p, int l, int r, int x, int y, int v, int tp) {
	if (x <= l && r <= y) {
		if (!tp) E[p].pb(v); else E[v].pb(p);
		return;
	}
	int mid = (l+r)>>1;
	if (x <= mid) qry(lc[p],l,mid,x,y,v,tp);
	if (mid < y) qry(rc[p],mid+1,r,x,y,v,tp);
}

void tarjan(int x) {
	dfn[x] = low[x] = ++tme;
	stk[++top] = x; in[x] = 1;
	for (auto y : E[x]) {
		if (!dfn[y]) tarjan(y), low[x] = min(low[x], low[y]);
		else if (in[y]) low[x] = min(low[x], dfn[y]);
	}
	if (dfn[x] == low[x]) {
		int z = 0; siz[++scc] = 0;
		do {
			z = stk[top--];
			in[z] = 0; col[z] = scc;
			if (z <= n) ++siz[scc];
		} while (z != x);
	}
}
void dfs(int x, int &sum) {
	if (x <= n) ++sum;
	dfn[x] = 0;
	for (auto y : E[x]) if (dfn[y]) dfs(y, sum);
}

void solve() {
	read(n); read(Q); n *= 3;
	tot = n; 
	for (int i = 1; i <= n; i++) E[i].clear();
	int rt0 = 0, rt1 = 0;
	build(rt0,1,n,0); build(rt1,1,n,1);
	while (Q--) {
		int l, r, x, y; read(l); read(r); read(x); read(y);
		int t = ++tot; E[t].clear();
		qry(rt0,1,n,l,r,t,0); qry(rt1,1,n,x,y,t,1); 
	}
	for (int i = 1; i <= tot; i++) dfn[i] = 0;
	tme = scc = 0;
	for (int i = 1; i <= tot; i++) if (!dfn[i]) tarjan(i);
	int k = 0, sum = 0;
	for (int i = 1; i <= scc; i++) {
		sum += siz[i];
		if (sum >= n/3) {
			if (sum <= 2*n/3) k = i; 
			else assert(siz[i] >= n/3), k = -i;
			break;
		}
	}
	if (k > 0) {
		puts("TAK"); sum = 0;
		for (int i = 1; i <= n; i++) putchar(col[i]<=k?'F':'R'), sum += (col[i]<=k);
		putchar('\n'); return;
	}
	assert(sum == n);
	k = -k;
	for (int i = 1; i <= tot; i++) if (col[i] == k) {
		sum = 0; dfs(k, sum);
		if (sum > 2*n/3) { puts("NIE"); return; }
		puts("TAK"); sum = 0;
		for (int j = 1; j <= n; j++) putchar(!dfn[j]?'F':'R'), sum += (!dfn[j]);
		putchar('\n'); return;
	}
}

int main() {
	int ttt; read(ttt);
	while (ttt--) solve();	
	return 0;
}