#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ull = unsigned long long;
#define ff(x) fixed << setprecision(x)
#define vel vector<long long>
#define vei vector<int>
#define ves vector<string>
#define asn ans
constexpr int inf = 0x3f3f3f3f;
constexpr ll INF = 0x3f3f3f3f3f3f3f3fLL;
constexpr db EPS = 1.0e-9;
constexpr ll MOD = 998244353LL;
constexpr ll SZ = 1e6;
constexpr ll MAXN5 = 2e5 + 5;
constexpr ll MAXN6 = 2e6 + 5;
ll n, m;

void Solve(void) {
    ll k, mid;
    cin >> n >> k >> mid;
    vector<ll> v;
    for (int i = 1; i <= n; i++) {
        ll x;
        cin >> x;
        v.push_back(x);
    }
    sort(v.begin(), v.end());
    if (k % 2 == 1) {
        int xia = lower_bound(v.begin(), v.end(), mid) - v.begin();
        if (xia != v.end() - v.begin() && v[xia] == mid) {
            for (xia; xia < v.size(); xia++) {
                if (v[xia] == mid) {
                    if (xia >= k / 2 && v.size() - 1 - xia >= k / 2) {
                        cout << "TAK" << '\n';
                        return;
                    }
                } else {
                    break;
                }
            }
        }
    } else {
        for (int i = 0; i < v.size(); i++) {
            if(v[i]>mid){
                break;
            }
            int xia1 =
                lower_bound(v.begin(), v.end(), 2 * mid - v[i]) - v.begin();
           
              
            if (xia1 != v.end() - v.begin() && v[xia1] == 2 * mid - v[i]) {
                // cout << i << ' ' << xia1 << '\n';
                if (i >= (k / 2) - 1 && n - xia1 - 1 >= (k / 2) - 1) {
                    cout << "TAK" << '\n';
                    return;
                }
            }
        }
    }
    cout << "NIE" << '\n';
}
int main(void) {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    // 	freopen("mine.in", "r", stdin);
    // 	freopen("mine.out", "w", stdout);

    int cas = 1;
    cin >> cas;
    while (cas--)
        Solve();
    return 0;
}