bool M1;
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<" MB\n"
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
#include <cstdio>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <cstring>
#include <array>
#include <algorithm>
#include <queue>
#include <vector>
#include <bitset>
#include <ctime>
#include <cstdlib>
#include <random>
#include <set>
#include <ctime>
#include <map>
#include <stack>
#include <unordered_map>
#include <assert.h>
#define i128 __int128
#define ll long long
#define uint unsigned
#define ull unsigned long long
#define ld long double
#define fo(a,b,c) for(ll a=b;a<=c;++a)
#define re(a,b,c) for(ll a=b;a>=c;--a)
#define pii pair<ll,ll>
#define pdd pair<db,db>
#define fi first
#define pb push_back
#define se second
#define ite set<ll> ::iterator
#define vite vector<ll> ::iterator
using namespace std;
const ll mod=998244353;
inline ll gi()
{
	ll 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;
}
ll _=1;
const ll inf=2e17+5,iinf=1e9;
const ll N=200005;
ll a[N];
map<ll,ll> mp;
void sol()
{
	ll n=gi(),k=gi(),m=gi();
	fo(i,1,n) a[i]=gi();
	sort(a+1,a+1+n);
	mp.clear();
	fo(i,1,n) mp[a[i]]++;
	if(k%2)
	{
		if(mp[m]==0)
		{
			cout<<"NIE";
			return;
		}
		ll ok=0;
		if(mp[m]!=0) ok=1,mp[m]--;
		ll rs=k/2;
		fo(i,1,n)
		{
			if(a[i]<=m)
			{
				if(mp[a[i]]!=0)
				{
					mp[a[i]]--;
					rs--;
				}
			}
			if(rs==0) break;
		}
		if(rs) ok=0;
		rs=k/2;
		fo(i,1,n)
		{
			if(a[i]>=m)
			{
				if(mp[a[i]]!=0)
				{
					mp[a[i]]--;
					rs--;
				}
			}
			if(rs==0) break;
		}
		if(rs) ok=0;
		if(ok) cout<<"TAK";
		else cout<<"NIE";
		return;
	}
	ll mn=inf;
	fo(i,1,n)
	{
		if(mp[a[i]]!=0&&mp[m*2-a[i]]!=0&&a[i]!=m)
		{
			mn=min(mn,abs(m-a[i]));
		}
	}
	if(mp[m]>=2) mn=0;
	if(mn==inf)
	{
		cout<<"NIE";
		return;
	}
	ll l=m-mn,r=m+mn;
	mp[l]--;
	mp[r]--;
	ll ok=1;
	ll rs=k/2-1;
	fo(i,1,n)
	{
		if(a[i]<=l)
		{
			if(mp[a[i]]!=0)
			{
				mp[a[i]]--;
				rs--;
			}
		}
		if(rs==0) break;
	}
	if(rs) ok=0;
	rs=k/2-1;
	fo(i,1,n)
	{
		if(a[i]>=r)
		{
			if(mp[a[i]]!=0)
			{
				mp[a[i]]--;
				rs--;
			}
		}
		if(rs==0) break;
	}
	if(rs) ok=0;
	if(ok)
	{
		cout<<"TAK";
	}
	else cout<<"NIE";
}
bool M2;
int main()
{
	int Time=clock();
	look_memory;
	_=gi();
	while(_--)
	{
		sol();
		printf("\n");
	}
	look_time;
	return 0;
}