#include<bits/stdc++.h>
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=30000+10;
int T,n,len,l[MAXN],r[MAXN];
int main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--) {
		cin>>n>>len;
		ffor(i,1,n) cin>>l[i]>>r[i];
		map<int,int> pre,tp;
		int free=0;
		ffor(i,1,n) {
			if(l[i]==-1&&r[i]==-1) free++;
			else {
				if(l[i]==-1) tp[r[i]]=2,pre[r[i]]++,pre[r[i]+1]--;
				else if(r[i]==-1) tp[l[i]]=1,pre[l[i]]++,pre[l[i]+1]--;
				else tp[l[i]]=tp[r[i]]=3,pre[l[i]]++,pre[r[i]+1]--;
			}
		}
		pre[len+1]+=0,pre[1]+=0;
		int sum=0,flg=0,must=0,most=0;
		for(auto it=pre.begin();it!=pre.end();it++) {
			if(it==--pre.end()) continue ;
			sum+=it->second;
			int L=it->first,R=(next(it)->first)-1;
			if(sum>=2) flg=1;
			else if(sum==0) {
				most+=R-L+1;
				if(tp[L-1]!=1&&tp[R+1]!=2) must++;
			}
		}
		if(!flg&&must<=free&&free<=most) cout<<"TAK\n";
		else cout<<"NIE\n";
	}
	return 0;
}