#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
cs int RLEN=1<<22|1;
char ibuf[RLEN],*ib,*ob;
inline char gc(){
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
	char ch=gc();
	int res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
inline ll readll(){
	char ch=gc();
	ll res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
template<typename tp>inline void chemx(tp &a,tp b){(a<b)?(a=b):0;}
template<typename tp>inline void chemn(tp &a,tp b){(a>b)?(a=b):0;}

cs int N=200005;
int n,k,m;
int a[N];
void solve(){
	n=read(),k=read(),m=read();
	for(int i=1;i<=n;i++)a[i]=read();
	sort(a+1,a+n+1);
	if(k&1){
		int t=k/2;
		for(int i=1;i<=n;i++)if(a[i]==m){
			int x1=i-1,x2=n-i;
			if(x1>=t&&x2>=t){
				puts("TAK");
				return;
			}
		}
		puts("NIE");
	}
	else{
		for(int i=1;i<=n;i++){
			int x=a[i];
			int y=2*m-a[i];
			int p=lower_bound(a+1,a+n+1,y)-a;
			if(p<=n&&a[p]==y){
				if(a[i]==a[p])p=i+1;
				else if(a[i]<=a[p]){
					int x1=i,x2=n-p+1;
					if(x1>=k/2&&x2>=k/2){
						puts("TAK");return;
					}
				}

			}
		}
		puts("NIE");
	}
}

int main(){
	#ifdef Stargazer
	freopen("1.in","r",stdin);
	#endif
	int T=read();
	while(T--)solve();
}