// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
//#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 1000000007
struct modint{
	unsigned int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x<o.x?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000006
#define inf 0x3f3f3f3f

int n,a[maxn],b[maxn],m,c;


void work()
{
	n=read(),m=read();
	For(i,1,n)a[i]=read(),b[i]=read();
	c=0;
	map<int,int>mp;
	For(i,1,n){
		if(a[i]==-1 && b[i]==-1) ++c;
		else {
			if(a[i]!=-1 && b[i]!=-1) {
				mp[a[i]]++;
				mp[b[i]+1]--;
			}
			else if(a[i]!=-1) mp[a[i]]++,mp[a[i]+1]--;
			else if(b[i]!=-1) mp[b[i]]++,mp[b[i]+1]--;
		}
	}
	int pres=0;
	int cov=0,lst=0;
	for(auto [x,y]:mp){
		if(pres){
			cov+=(x-lst);
		}
		lst=x;
		pres+=y;
		if(pres>1){
			puts("NIE");
			return;
		}
	}
	int mx=m-cov;
	
	vector<pii>o;
	For(i,1,n){
		if(a[i]!=-1) o.pb(mkp(a[i],0));//toR
		if(b[i]!=-1) o.pb(mkp(b[i],1));//toL
	}
	o.pb(mkp(0,1));
	o.pb(mkp(m+1,0));
	sort(ALL(o));
	
	int nd=0;
	For(i,0,SZ(o)-2){
		if(o[i].se==1 && o[i+1].se==0 && o[i].fi+1!=o[i+1].fi){
		//	cout<<"ND "<<o[i].fi<<" "<<o[i+1].fi<<"\n";
			++nd;
		}
	}
	
	int mn=nd;
	
//	cout<<"mn,mx "<<mn<<" "<<mx<<"\n";
	if(mn<=n && n<=mx) puts("TAK");
	else puts("NIE");
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}
/*

*/