#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define pii pair<int,int>
#define ll long long
#define fi first
#define se second
#define bg begin
#define ull unsigned long long
cs ll mod=(ll)1e18+3;
cs int RLEN=1<<22|1;
char ibuf[RLEN],*ib,*ob;
inline char gc(){
    (ib==ob)&&(ob=(ib=ibuf)+fread(ibuf,1,RLEN,stdin));
    return (ib==ob)?EOF:*ib++;
}
inline int read(){
	char ch=gc();
	int res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
inline ull readp(){
	char ch=gc();
	ull res=0;
	while(!isdigit(ch))ch=gc();
	while(isdigit(ch))res=((res+(res<<2)<<1)+(ch^48))%mod,ch=gc();
	return res;
}
template<typename tp>inline void chemx(tp &a,tp b){(a<b)?(a=b):0;}
template<typename tp>inline void chemn(tp &a,tp b){(a>b)?(a=b):0;}
cs int N=200005;

int n,L;

void solve(){
	n=read();L=read();
	int cnt=0;
	vector<pair<pii,int>>nd;
	for(int i=1;i<=n;i++){
		int a=read(),b=read();
		if(a==-1&&b==-1)cnt++;
		else{
			int ok=0;
			if(a==-1)a=b,ok=1;
			if(b==-1)b=a,ok=1;
			nd.pb(make_pair(pii(a,b),ok));
		}
	}
	int res=0,res2=0;
	sort(nd.begin(),nd.end());
	int lst=0,ok=0;
	for(auto x:nd){
		if(x.fi.fi<=lst){
			puts("NIE");return;
		}
		res+=x.fi.fi-lst-1;
		if((x.fi.fi-lst-1>0)&&ok==0&&x.se==0)res2++;
		ok=x.se;
		lst=x.fi.se;
	}
	if(L>lst&&ok==0)res2++;
	res+=L-lst;
	if(res<cnt||cnt<res2){
		puts("NIE");
	}
	else puts("TAK");
}

int main(){
	#ifdef Stargazer
	freopen("1.in","r",stdin);
	#endif
	int T=read();
	while(T--)solve();
}