#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand()%x; }
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
// head

const int MAXN=2e5+10;
ll n,l;

void solve() {
	scanf("%lld%lld",&n,&l);
	vector<pii> evt,ievt;
	ll cnt=0,nw=0;
	rep(i,1,n+1) {
		ll a,b;
		scanf("%lld%lld",&a,&b);
		if (a==-1 and b==-1) {
			cnt++;
			continue;
		}
		else if (a==-1) evt.eb(b,1),evt.eb(b+1,-1),ievt.eb(b,0);
		else if (b==-1) evt.eb(a,1),evt.eb(a+1,-1),ievt.eb(a,1);
		else evt.eb(a,1),evt.eb(b+1,-1),ievt.eb(a,1),ievt.eb(b,0);
	}
	ievt.eb(l+1,1);
	sort(all(evt));
	sort(all(ievt));
	bool ok=1;
	for (auto [a,b] : evt) {
		if (nw>=2) ok=0;
		nw+=b;
	}
	ll lasp=0,las=0,gao=0,gaol=0;
	for (auto [a,b] : ievt) {
		// cerr<<a<<" "<<b<<endl;
		if (las==0 and b==1) {
			gaol+=(a-lasp-1);
			// cerr<<a<<" "<<lasp<<endl;
			if (a-lasp-1>0) gao++;
		}
		las=b,lasp=a;
	}
	// cerr<<"gaol "<<gaol<<endl<<"cnt "<<cnt<<endl<<"gao "<<gao<<endl;
	if (gao>cnt || cnt>gaol) ok=0;
	puts((ok?"TAK":"NIE"));
}

int _;
signed main() {
	// freopen("qwq.in","r",stdin);
	// freopen("qwq.out","w",stdout);

	scanf("%d",&_);
	while (_--) solve();
}