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

string Solve(int N, int K, int M, vector<int> A) {
	sort(A.begin(), A.end());

	// Case #1: Odd
	if (K % 2 == 1) {
		int bar = K / 2;
		for (int i = bar; i < N - bar; i++) {
			if (A[i] != M) continue;
			return "TAK";
		}
		return "NIE";
	}

	// Case #2: Even
	for (int i = 0; i < N; i++) {
		int pos1 = lower_bound(A.begin(), A.end(), M * 2 - A[i]) - A.begin();
		if (pos1 == N || A[pos1] != M * 2 - A[i]) continue;
		int cnt = min(i + 1, N - pos1);
		if (cnt * 2 >= K) return "TAK";
	}
	return "NIE";
}

int main() {
	int T; cin >> T;
	for (int t = 1; t <= T; t++) {
		int N, K, M; cin >> N >> K >> M;
		vector<int> A(N, 0);
		for (int i = 0; i < N; i++) cin >> A[i];
		cout << Solve(N, K, M, A) << endl;
	}
	return 0;
}