#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
const int MAX = 2e5 + 10;

int a[MAX];
map <int, int> mk;

void solve(){
	int n = read(), k = read(), m = read();
	for(int i = 1; i <= n; i++){
		a[i] = read();
	}
	sort(a + 1, a + n + 1);
	if(k % 2){
		bool fl = 0;
		for(int i = 1; i <= n; i++){
			if(a[i] == m){
				if(i - 1 >= k / 2 and n - i >= k / 2){
					fl = 1;
					break;
				}
			}
		}
		if(fl){
			puts("TAK");
		}else{
			puts("NIE");
		}
	}else{
		bool fl = 0;
		for(int i = 1; i <= n; i++){
			if(mk.count(2 * m - a[i])){
				// write(i), endl;
				if(mk[2 * m - a[i]] - 1 >= k / 2 - 1 and n - i >= k / 2 - 1){
					fl = 1;
					break;
				}
			}
			mk[a[i]] = i;
		}
		if(fl){
			puts("TAK");
		}else{
			puts("NIE");
		}
	}
	mk.clear();
}

signed main(){
	int t = read();
	while(t--)	solve();
	return 0;
}