#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
#define FILE "read"
#define MAXN (int)1e6+10
struct node{int y,next;}e[MAXN];
int n,m,tot,len,cnt[MAXN],a[MAXN],b[MAXN],Link[MAXN],f[MAXN],ans[MAXN];
inline int read(){
	int x=0,f=1;  char ch=getchar();
	while(!isdigit(ch))  {if(ch=='-')  f=-1;  ch=getchar();}
	while(isdigit(ch))  {x=x*10+ch-'0';  ch=getchar();}
	return x*f;
}
void insert(int x,int y){e[++tot].next=Link[x];Link[x]=tot;e[tot].y=y;}
void updata(int x){
	if(f[x])  ans[f[x]]=1;
	else insert(b[x+1],x+1);
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	n=read();  for(int i=1;i<=n;++i)  a[i]=read();
	m=read();
	for(int i=1;i<=m;++i){
		cnt[i]=read();
		for(int j=1;j<=cnt[i];++j)b[++len]=read();
		insert(b[len-cnt[i]+1],len-cnt[i]+1); f[len]=i;;
	}
	for(int i=1;i<=n;++i){
		int temp=Link[a[i]];  Link[a[i]]=0;
		for(int j=temp;j;j=e[j].next)updata(e[j].y);
	}
	for(int i=1;i<=m;++i) puts(ans[i]?"TAK":"NIE");
	return 0;
}