#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());
    if (k % 2)
    {
        for (int i = 0; i < n; ++i)
        {
            if (a[i] == m && i >= k / 2 && n - 1 - i >= k / 2)
            {
                cout << "TAK\n";
                return;
            }
        }
        cout << "NIE\n";
    }
    else
    {
        for (int i = 0; i < n && a[i] <= m; ++i)
        {
            int p = lower_bound(a.begin() + i + 1, a.end(), m * 2 - a[i]) - a.begin();
            if (p == n || a[p] != m * 2 - a[i]) continue;
            if (i >= k / 2 - 1 && n - 1 - p >= k / 2 - 1)
            {
                cout << "TAK\n";
                return;
            }
        }
        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;
}