#include<bits/stdc++.h>
using namespace std;
using ll=long long;

void solve(){
	int n,l;
	cin>>n>>l;

	vector<int> b,L,R;
	map<int,int> mp1,mp2;

	int sum=0,k=n;
	bool flag=1;

	for(int i=1;i<=n;i++){
		int x,y;
		cin>>x>>y;
		if(x!=-1&&y!=-1){
			l-=y-x+1;
			k--;
			L.push_back(x);
			R.push_back(y);
		}
		else if(x!=-1){
			b.push_back(y);
			if(mp1[y]){
				flag=0;
			}
			mp1[y]=1;
		}
		else if(y!=-1){
			b.push_back(x);
			if(mp2[x]){
				flag=0;
			}
			mp2[x]=1;
		}
	}

	if(l<k||!flag){
		cout<<"NIE\n";
		return;
	} 

	for(auto t:b){
		auto it=lower_bound(R.begin(),R.end(),t);
		if(it!=R.end()){
			int p=it-R.begin();
			if(t==R[p]||t>=L[p]){
				flag=0;
				break;
			}
		}
	}

	cout<<(flag?"TAK\n":"NIE\n");
}

int main(){
	ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);

	int t=1;
	cin>>t;
	while(t--) solve();

	return 0;
}