//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
using namespace std;
const int N = 2e5;
int n, k, m;
int a[N + 1];
int cnt[3];
void read()
{
    cin >> n >> k >> m;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
        a[i] -= m;
    }
}
void solve()
{
    sort(a + 1, a + n + 1);
    if (k & 1)
    {
        for (int i = 1; i <= n; )
        {
            int j = i;
            while (j <= n && a[j] == a[i])
            {
                ++j;
            }
            int x = i - 1;
            int y = j - i;
            int z = n - j + 1;
            --y;
            i = j;
            if (a[i - 1] != 0)
            {
                continue;
            }
            int t = min(x, z);
            k -= t;
            k -= y/2 * 2;
            k -= 1;
            if (k <= 0)
            {
                cout << "TAK" << '\n';
                return ;
            }
        }
        cout << "NIE" << '\n';
    }
    else
    {
        for (int i = 1; i <= n; ++ i)
        {
            if (a[i] > 0)
            {
                break;
            }
            if (a[i] == 0)
            {
                if (i == n)
                {
                    break;
                }
                if (a[i + 1] == a[i])
                {
                    cout << "TAK" << '\n';
                    return ;
                }
                break;
            }
            int j = lower_bound(a + 1, a + n + 1, -a[i]) - a;
            if (j < 1 || j > n || a[j] != -a[i])
            {
                continue;
            }
            int x = i - 1, z = n - j + 1;
            if (min(x, z) * 2 + 2 >= k)
            {
                cout << "TAK" << '\n';
                return ;
            }
        }
        cout << "NIE" << '\n';
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
    }
    int t = 1;
    bool typetest = true;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}