#include <bits/stdc++.h>

#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll long long
#define YES "TAK"
#define NO "NIE"
#define endline '\n'

using namespace std;

const ll N = 5e5 + 10, MM = 998244353, MAX = 1e18;

int solve() {
  ll n,k,m;cin>>n>>k>>m;
  vector<ll>v(n);
  map<ll,ll>mp;
  for(int i=0;i<n;i++)cin>>v[i],mp[v[i]]++;
  sort(v.begin(),v.end());
  if(v.back()<m||v.front()>m)return cout<<NO<<endline,0;
  if(k%2){
    if(!mp.count(m))return cout<<NO<<endline,0;
    ll sum=0;
    for(auto x:mp){
      if(x.first==m)break;
      sum+=x.second;
    }
    ll sum1=n-mp[m]-sum;
    if(min(sum,sum1)+mp[m]-1>=k/2)cout<<YES<<endline;
    else cout<<NO<<endline;
  }else{
    v.clear();
    for(auto x:mp)v.emplace_back(x.first);
    int i=0,j=v.size()-1;
    ll sum1=0,sum2=0;
    while(v[i]<m)i++;
    while(v[j]>m)j--;
    while(i>=0&&j<v.size()){
      if(v[i]+v[j]>2*m)i--;
      else if(v[i]+v[j]<2*m)j++;
      else if(i==j&&mp[v[i]]==1)i--,j++;
      else break;
    }
    if(i<0||j>=v.size())return cout<<NO<<endline,0;
    for(int k=0;k<i;k++){
      sum1+=mp[v[k]];
    }
    for(int k=0;k<j;k++){
      sum2+=mp[v[k]];
    }
    if(i==j){
      if(min(sum2,sum1)+mp[m]-1>=k/2)cout<<YES<<endline;
      else cout<<NO<<endline;
    }else{
      sum1+=mp[v[i]];
      sum2+=mp[v[j]];
      if(sum1>=k/2&&sum2>=k/2)cout<<YES<<endline;
      else cout<<NO<<endline;
    }
  }

  return 0;
}

int main() {
	speed;
	int t = 1;
	cin >> t;
	int i = 1;
	while (t--) {
		//cout << "Case #" << i++ << ": ";
		solve();
	}
	return 0;
}
/*


*/