#include<bits/stdc++.h>
#define rep(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
const int N=1.5e6+5;
int T,n,m,las[N],vis[N],bj[N];
set<int> in[N],ot[N];
multiset<int> se;
vector<int> v[N];
void del(int u){
	vis[u]=1;
	for(auto x:v[u]) if(!bj[x]) se.erase(se.find(x));
	for(auto v:ot[u]) if(!vis[v]){
		in[v].erase(u);
		if(in[v].empty()&&!vis[v]) del(v);
	}ot[u].clear();
	for(auto v:in[u]) if(!vis[v]) del(v);
	in[u].clear();
}
void add(int u,int v){if(!vis[u]) in[v].insert(u),ot[u].insert(v);}
void sol(){
	cin>>n>>m,iota(las+1,las+n+1,1); int tot=n,lans=0;
	rep(i,1,n) v[i].push_back(i),se.insert(i);
	auto dec=[&](int x){return (x-1+lans)%n+1;};
	rep(i,1,m){
		char o; cin>>o;
		if(o=='K'){
			int u=++tot,k,x; cin>>k;
			rep(j,0,k-1) cin>>x,x=dec(x),v[u].push_back(x),add(las[x],u),las[x]=u,se.insert(x);
			if(in[u].empty()) del(u);
		}else if(o=='N'){
			int p; cin>>p,p=dec(p);
			if(!vis[las[p]]) del(las[p]);
		}else if(o=='P'){int p; cin>>p,p=dec(p),se.erase(p),bj[p]=1;}
		else if(o=='Q'){
			int p; cin>>p,p=dec(p);
			if(se.empty()) cout<<"TAK\n",lans=0;
			else{
				auto it=se.lower_bound(p);
				if(it==se.end()) it=se.begin();
				cout<<"NIE "<<(lans=*it)<<'\n';
			}
		}
	}se.clear();
	rep(i,1,tot) in[i].clear(),ot[i].clear(),vis[i]=bj[i]=0,v[i].clear();
}
int main(){
	ios::sync_with_stdio(false);
	cin>>T; while(T--) sol();
}