#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t;
	cin >> t;
	while (t--)
	{
		int n, m, k = 2e9, cnt = 0;
		cin >> n >> m;
		map<int, int> mp, mp1, mp2;
		set<int> s, s2;
		for (int i = 1; i <= n; i++)
		{
			int l, r;
			cin >> l >> r;
			if (l == -1 && r == -1) cnt++;
			else if (l != -1 && r != -1) mp[l]++, mp[r + 1]--, s.insert(l), s2.insert(r + 1);
			else if (l != -1) k = min(k, l), mp1[l]++;
			else mp2[r]++, s.insert(r + 1);
		}
		int cnt2 = cnt;
		s.insert(m + 1);
		bool flag = true;
		for (auto i : mp1)
		{
			if (i.second >= 2) flag = false;
			else
			{
				int x = *s.upper_bound(i.first);
				mp[i.first]++, mp[x]--;
			}
		}
		s2.insert(1);
		for (auto i : mp2)
		{
			if (i.second >= 2)
			{
				flag = false;
				continue;
			}
			if (i.first >= k) continue;
			int x = *(--s2.upper_bound(i.first));
			mp[x]++, mp[i.first + 1]--;
		}
		mp[1] = mp[1], mp[m + 1] = mp[m + 1];
		int now = 0, last = 0, last2 = 0;
		for (auto i : mp)
		{
			now += i.second;
			if (last)
			{
				cnt2 -= i.first - last;
				last = 0;
			}
			if (last2 && (now || i.first == m + 1))
			{
				if (!mp2[i.first - 1]) flag = false;
				last2 = 0;
			}
			if (i.first > m) break;
			if (now >= 2) last2 = i.first;
			if (now == 0) cnt--, last = i.first;
		}
		cout << ((flag && cnt >= 0 && cnt2 <= 0) ? "TAK" : "NIE") << '\n'; 
	}
	return 0;
}