#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
map<int,int> t;
int T,n,m,a[N],b[N];
int calc()
{
	int sum=0,ans=0;
	for(auto k:t)
	{
		sum+=k.second;
		if(sum>2) return 1e9;
		ans+=(sum==0);
	}
	return ans;
}
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d",&n,&m);
		long long len=0;
		int cnt=0;
		vector<int> v{0,m+1};
		for(int i=1;i<=n;i++)
		{
			scanf("%d%d",&a[i],&b[i]);
			if(a[i]!=-1&&b[i]!=-1) len+=b[i]-a[i]+1;
			else len++;
			if(a[i]==-1&&b[i]==-1) cnt++;
			if(a[i]!=-1) v.push_back(a[i]);
			if(b[i]!=-1&&a[i]!=b[i]) v.push_back(b[i]); 
		}
		sort(v.begin(),v.end());
		if(len>m||unique(v.begin(),v.end())!=v.end())
		{
			puts("NIE");
			continue;
		}
		t.clear();
		t[m+1]=2,t[1]=0;
		for(int i=1;i<=n;i++)
		{
			if(a[i]==-1&&b[i]==-1) continue;
			int val=1;
			if(a[i]==-1) b[i]=*++lower_bound(v.begin(),v.end(),a[i])-1;
			else if(b[i]==-1) a[i]=*--lower_bound(v.begin(),v.end(),b[i])+1;
			else val=2;
			t[a[i]]+=val,t[b[i]+1]-=val;
		}
		puts(calc()<=cnt?"TAK":"NIE");
	}
}