#include<bits/stdc++.h>
using namespace std;
#define LL long long
struct segment{
	LL l,r,val;
}p[500005];
LL n,i,j,k,m,t;
LL cmp(segment x,segment y){
	return x.val<y.val; 
}
int main(){
	scanf("%lld",&t);
	while(t--){
		scanf("%lld%lld",&n,&m);
		for(i=1;i<=n;i++){
			scanf("%lld%lld",&p[i].l,&p[i].r);
			p[i].val=0x7fffffff;
			if(p[i].l!=-1) p[i].val=min(p[i].val,p[i].l);
			if(p[i].r!=-1) p[i].val=min(p[i].val,p[i].r); 
		}
		sort(p+1,p+n+1,cmp);
		LL now=0,sum=0,num=0,tmp=m;
		bool flag=true,flag1=false;
		for(i=1;i<=n;i++){
			if(p[i].val==0x7fffffff){
				num++;
			}
			else{
				if(p[i].l!=-1 && p[i].l<=now){
					printf("NIE\n");
					flag1=true;break;
				}
				if(p[i].r!=-1 && p[i].r<=now){
					printf("NIE\n");
					flag1=true;break;
				}
				if(flag==true){
					if(p[i].l==-1 || p[i].l==now+1) ;
					else sum++; 
				}
				if(p[i].r!=-1) now=p[i].r,flag=true;
				else now=p[i].l,flag=false;
				if(p[i].l!=-1 && p[i].r!=-1) tmp-=p[i].r-p[i].l+1;
				else tmp--;
			}
		}
		if(flag1==true) continue;
		if(tmp<num || sum>num) printf("NIE\n");
		else printf("TAK\n");
	}
	return 0;
}