#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve()
{
    int n, k, m;
    cin >> n >> k >> m;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    sort(a.begin(), a.end());
    int l = lower_bound(a.begin(), a.end(), m) - a.begin();
    int r = upper_bound(a.begin(), a.end(), m) - a.begin();
    if (l >= r || r - l == 1 && k % 2 == 0) cout << "NIE\n";
    else if (min(l, n - r) * 2 + r - l >= k) cout << "TAK\n";
    else cout << "NIE\n";
    return;
}

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