// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mod = 998244353;
const int N = 2e5 + 5;

int n, k, m;
int a[N];
void MAIN() {
    cin >> n >> k >> m;

    map<int, int> mp;

    for (int i = 1; i <= n; ++i) cin >> a[i];
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; ++i)
        if (!mp.count(a[i])) mp[a[i]] = i;
    if (k & 1) {
        k /= 2;
        for (int i = 1; i <= n; ++i)
            if (a[i] == m && i > k && (n - i) >= k)
                return cout << "TAK" << endl, void();
        cout << "NIE" << endl;
    } else {
        k /= 2, --k;

        for (int i = k + 1; i < n && a[i] <= m ; ++i) {
            int nx = (m * 2) - a[i];
            if (mp.count(nx) && n - mp[nx] >= k)
                return cout << "TAK" << endl, void();
        }
        cout << "NIE" << endl;
    }
}

int main() {
#ifdef LOCAL
    auto start = chrono::steady_clock::now();
    freopen("miku.in", "r", stdin);
    freopen("miku.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--) MAIN();
#ifdef LOCAL
    auto end = chrono::steady_clock::now();
    cout << "\nqwq: " << chrono::duration_cast<chrono::milliseconds>(end - start).count() << "ms\n";
#endif
    return 0;
}