#include<bits/stdc++.h>
#define int long long
#define db double
#define ll long long
#define pii pair<int, int>
using namespace std;
const int maxn = 2e5 + 999;
int arr[maxn];
void solve() {
    int n, k, m;
    cin >> n >> k >> m;
    map<int, int> pre, suf, eq;
    for (int i = 1; i <= n; i++)
        cin >> arr[i];
    sort(arr + 1, arr + 1 + n);
    for (int i = 1; i <= n; i++) {
        eq[arr[i]]++;
        if (i != 1 && arr[i] > arr[i - 1])
            pre[arr[i]] = pre[arr[i - 1]] + eq[arr[i - 1]];
    }
    for (int i = n; i; i--) {
        if (i != n && arr[i] < arr[i + 1])
            suf[arr[i]] = suf[arr[i + 1]] + eq[arr[i + 1]];
    }
    if (k & 1){
        if (eq[m] > 0) {
            int sml = pre[m], big = suf[m];
            int tem = min(k / 2, sml) + min(k / 2, big);
            if (tem + eq[m] >= k) {
                cout << "TAK\n";
                return;
            }
        }
    }
    else{
        for (int i = 1; i < n; i++) {
            // arr[i] + arr[j] = m * 2
            int need = m * 2 - arr[i];
            if (need == arr[i]) {
                int sml = pre[arr[i]], big = suf[arr[i]];
                int tem = min(sml, k / 2 - 1) + min(big, k / 2 - 1);
                if (tem + eq[arr[i]] >= k) {
                    cout << "TAK\n";
                    return;
                }
            } else {
                int sml = pre[arr[i]] + eq[arr[i]];
                int big = suf[need] + eq[need];
                int tem = min(sml, k / 2) + min(big, k / 2);
                if (tem >= k) {
                    cout << "TAK\n";
                    return;
                }
            }
        }
    }
    cout << "NIE\n";
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}