#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll num[202020];
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	ll t,n,rn,l,r,cnt,lim,count;
	cin>>t;
	while(t--){
		cin>>n>>rn;
		cnt=lim=count=0;
		vector<ll>a1,a2;
		for(int i=1;i<=n;i++){
			num[i]=0;
		} 
		ll f=0;
		for(int i=1;i<=n;i++){
			cin>>l>>r;
			if(l!=-1&&r!=-1){
				for(int j=l;j<=r;j++){
					if(num[j]==1) f=1;
					num[j]=1;
				}	
			}
			else{
				if(l!=-1){
					if(num[l]==1) f=1;
					num[l]=1;
					a1.push_back(l);
				}
				else if(r!=-1){
					if(num[r]==1) f=1;
					num[r]=1;
					a2.push_back(r);
				}
				else cnt++;
			}
		}
		if(f){
			cout<<"NIE"<<'\n';
			continue;
		}
		for(auto it:a1){
			ll y=it;
			while(num[y+1]==0&&y<rn) y++;
			for(int i=it;i<=y;i++) num[i]=1;
			lim+=y-it;
		}
		for(auto it:a2){
			ll y=it;
			while(num[y-1]==0&&y>1) y--;
			for(int i=y;i<=it;i++) num[i]=1;
			lim+=it-y;
		}
		for(int i=1;i<=n;i++){
			if(num[i]==0&&(num[i-1]==1||i==1)) count++;
		}
		if(count<=cnt&&count<=lim) cout<<"TAK"<<'\n';
		else cout<<"NIE"<<'\n';
	}
	return 0;
}