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

bool cmp(pair<int,int> x,pair<int,int> y)
{
	if(x.first*x.second < 0 && y.first*y.second < 0 )
	{
		return abs(x.first*x.second) < abs(y.first * y.second );
	}
	else if(x.first*x.second < 0 )
		return abs(x.first*x.second) < y.first;
	else if(y.first*y.second < 0)
		return x.first < abs(y.first * y.second );
	else 
		return x.first < y.first;
	
}
void solve()
{
	int n,L;
	cin>>n>>L;

	vector<pair<int,int> > v;

	
	int nume = 0 ;
	// 1:-> 2:<- 如果固定区间: 3:-> 4:<-
	for(int i=0;i<n;i++)
	{
		int l,r;
		cin>>l>>r;
		
		if(l == -1 && r == -1)
			nume ++;
		else 
			v.push_back({l,r});
			
		
	}
	sort(v.begin(),v.end(),cmp);
	int hs = 0 ;
	
	int ls = 0;
	int tag = 0 ; // 0 <- 1->

	for(auto [l,r]:v)
	{
		//cout<<l<<' '<<r<<endl;
		
		if((l == -1 && r <= ls) || (l == -1 && r <= ls) || (l != -1 && r != -1 && r <= ls ) )
		{
			
			
			cout<<"NIE"<<endl;
			return ;
		
		}
		auto check=[&]()
		{
			if(nume)
			{
				nume -- ;
				hs += l-2 - ls;
				ls = l - 1;
				return false ;
			}
			return true ;
		};
		if(l == -1)
		{   
			hs += r - ls  - 1;
			ls = r;
			tag = 0 ;
		}
		else if(r == -1)
		{	
			//cout<<1<<endl;
		
			if(ls != l-1 && tag == 0)
			{
				
				
				if(check())
				{
					cout<<"NIE"<<endl;
					return ;
				}
				
			}
			hs += l-ls-1;
			ls = l;
			tag = 1;
		}
		else 
		{
			if(ls!= l-1 && tag == 0)
			{
				if(check())
				{
					cout<<"NIE"<<endl;
					return ;
				}
			}
			hs += l-ls-1;
			ls = r;
			tag = 0;
		}
		
	}
	//cout<<nume<<' '<<hs<<endl;
	if(tag == 1)
	{
		hs += L - ls;
		ls = L;
		tag = 0;
	}
	if(ls != L )
	{
		if(!nume)
		{
			cout<<"NIE"<<endl;
			return ;
		}
		else 
		{
			
			hs += L - ls;
			ls = L;
		}
	}
	//cout<<nume<<' '<<hs<<endl;
	
	if(hs < nume)
	{
		cout<<"NIE"<<endl;
		return ;
	}
	
	cout<<"TAK"<<endl;
	
}  	
signed main (){
	std::ios::sync_with_stdio(false);  
	cin.tie(NULL); 
	cout.tie(NULL);
	int t;
	cin>>t;
	while(t--)
		solve();
}