#include <bits/stdc++.h>
using namespace std;
#define int long long

#define dbg(x...) \
do { \
std::cout << #x << " -> "; \
err(x); \
} while (0)

void err() {
	std::cout << std::endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
	std::cout << fixed << setprecision(10) << arg << ' ';
	err(args...);
}

void GENSHEN_START() {
	int n,k,m;cin >> n >> k >> m;
	vector<int>a(n + 5);
	map<int,int>mp;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		mp[a[i]]++;
	}
	sort(a.begin() + 1,a.begin() + 1 + n);
	if (k % 2) {
		if (!mp[m]) {
			cout << "NIE" << '\n';
			return ;
		}
		int cnt = 0,cnt0 = 0,cnt1 = 0;
		for (int i = 1; i <= n; ++i) {
			if (a[i] == m) cnt++;
			else if (a[i] < m) cnt0++;
			else cnt1++;
		}
		cnt--;
		if (cnt0 < k / 2) {
			if (cnt0 + cnt >= k / 2) cout << "TAK" << '\n';
			else cout << "NIE" << '\n'; 
			return ;
		}
		else if (cnt1 < k / 2) {
			if (cnt1 + cnt >= k / 2) cout << "TAK" << '\n';
			else cout << "NIE" << '\n'; 
			return ;
		}
		else if (cnt0 < k / 2 && cnt1 < k / 2) {
			if (cnt0 + cnt >= k / 2 && cnt1 + (cnt - k / 2 + cnt0) >= k / 2) cout << "TAK" << '\n';
			else cout << "NIE" << '\n'; 
			return ;
		}
	}
	else {
		for (int i = 1; i <= n; ++i) {
			if (mp[m * 2 - a[i]]) {
				int l = min(a[i],m * 2 - a[i]),r = max(a[i],m * 2 - a[i]);
				//dbg(l,r);
				int upr = upper_bound(a.begin() + 1,a.begin() + 1 + n,r) - a.begin();
				upr = n - upr + 1;
				int downl = lower_bound(a.begin() + 1,a.begin() + 1 + n,l) - a.begin() - 1;
				//dbg(downl,upr);
				if (l == r) {
					int cnt = mp[l] - 2;
					if (downl < k / 2 - 1) {
						cnt -= k / 2 - 1 - downl;
					}
					if (upr < k / 2 - 1) {
						cnt -= k / 2 - 1 - upr;
					}
					if (cnt >= 0) {
						cout << "TAK" << '\n';
						return ;
					}
				}
				else {
					int cntl = mp[l] - 1,cntr = mp[r] - 1;
					if (downl < k / 2 - 1) {
						cntl -= k / 2 - 1 - downl;
					}
					if (upr < k / 2 - 1) {
						cntr -= k / 2 - 1 - upr;
					}
					if (cntl >= 0 && cntr >= 0) {
						cout << "TAK" << '\n';
						return ;
					}
				}
			}
		}	
		cout << "NIE" << '\n';
	}
}

signed main() {
	ios::sync_with_stdio(false);cin.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) GENSHEN_START();
	return 0;
}