#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 1;
int sz[N];

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

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}