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

#define ull unsigned long long
#define ll long long
#define edl '\n'

const int N = 1e6 + 10;
const int M = 1e3 + 10;

const int mod = 1e9 + 7;
ll n,m,q;
string s;

struct QWQ
{
	ll x,y;
}a[N],c[N],ans[N];

bool cmp(QWQ A,QWQ B)
{
	return A.x < B.x;
}

bool cmp2(QWQ A,QWQ B)
{
	return A.y < B.y;
}

void solve()
{
	ll sum = 0;
	ll la,lc,lans;
	la = lc = lans = 0;
	cin >> n >> m;
	for(int i = 1; i <= n; i ++ )
	{
		ll l,r;
		cin >> l >> r;
		if(l == -1 && r == -1) sum ++;
		else if(l == -1) a[++la] = {l,r};
		else c[++lc] = {l,r};
	}
	sort(c + 1, c + lc + 1,cmp);
	sort(a + 1, a + la + 1,cmp2);
	int i = 1;
	int j = 1;
	while(j <= lc)
	{
		while(i <= la && a[i].y <= c[j].x)
		{
			ans[++lans] = a[i];
			i ++;
		}
		ans[++lans] = c[j];
		++j;
	}
	while(i <= la)
	{
		ans[++lans] = a[i];
		++i;
	}
	ans[++lans] = {m + 1,m + 1};
	ans[lans + 1] = {m + 2,m + 2};
	ll kk = 0;
	for(int i = 1; i <= lans; i ++ )
	{
		if(ans[i].x == -1)
		{
			ans[i].x = ans[i - 1].y + 1;
			kk += ans[i].y - ans[i].x;
		}
		if(ans[i].y == -1)
		{
			if(ans[i + 1].x != -1)
			{
				ans[i].y = ans[i + 1].x - 1;
			}
			else
			{
				ans[i].y = ans[i + 1].y - 1;
				ans[i + 1].x = ans[i + 1].y;
			}
			kk += ans[i].y - ans[i].x;
		}
	}
	for(int i = 1; i <= lans; i ++ )
	{
		if(ans[i].x <= ans[i].y) continue;
		else
		{
			cout << "NIE" << edl;
			return;
		}
	}
	for(int i = 1; i <= lans; i ++ )
	{
		if(ans[i].x > ans[i - 1].y + 1)
		{
			kk += ans[i].x - ans[i - 1].y - 1;
		}
		else if(ans[i].x == ans[i - 1].y + 1) continue;
		else
		{
			cout << "NIE" << edl;
			return;
		}
	}
	if(sum <= kk && sum >= 0) cout << "TAK" << edl;
	else cout << "NIE" << edl;
}

int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	cin >> t;
	while(t -- ) solve();
	return 0;
}