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

#define dbg(x...) \
do { \
std::cout << #x << " -> "; \
err(x); \
} while (0)

void err() {
	std::cout << std::endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
	std::cout << fixed << setprecision(10) << arg << ' ';
	err(args...);
}

void GENSHEN_START() {
	int n,L;cin >> n >> L;
	unordered_map<int,int>vis;
	vector<int>num;
	int cnt = 0;
	int ok = 0;
	for (int i = 1;i <= n;i++) {
		int l,r;cin >> l >> r;
		if (l == -1 && r == -1) {
			cnt++;
		}
		else if (r == -1) {
			num.push_back(l);
			if (vis[l]) ok = 1;
			vis[l] = 3e9;
		}
		else if (l == -1) {
			num.push_back(r);
			if (vis[r]) ok = 1; 
			vis[r] = 2e9;	
		}
		else {
			num.push_back(l);
			if (vis[l]) ok = 1;
			num.push_back(r);
			if (vis[r]) ok = 1;
			vis[l] = r;
			vis[r] = 4e9;
		}
	}
	//dbg(ok);
	if (ok) {
		cout << "NIE" << '\n';
		return ;
	}
	sort(num.begin(),num.end());
	int len = num.size();
	int suit = 0,least = 0;
	for (int i = 0;i < len;i++) {
		if (i == len - 1) {
			if (num[i] != L && vis[num[i]] != 3e9) least++;
			break;
		}
		if (num[i] != 1 && i == 0 && vis[num[i]] != 2e9) least++;
		int nxt = num[i + 1];
		if (vis[num[i]] == 2e9) {
			if (vis[nxt] == 2e9) {
				suit += nxt - num[i] - 1;
			}
			else if (vis[nxt] == 3e9) {
				if (nxt != num[i] + 1) least += 1;
			}
			else {
				if (nxt != num[i] + 1) least += 1;
			}
		}
		else if (vis[num[i]] == 3e9) {
			suit += nxt - num[i] - 1;
		}
		else {
			if (nxt != vis[num[i]]) {
				cout << "NIE" << '\n';
				return ;
			}
		}
		//dbg(i,num[i]);
	}
	//dbg(cnt,least,suit);
	if (cnt < least) {
		cout << "NIE" << '\n';
		return ;
	}
	if (cnt > suit) {
		cout << "NIE" << '\n';
		return ;
	}
	cout << "TAK" << '\n';
	return ;
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) GENSHEN_START();
	return 0;
}