// Problem: F - Missing Boundaries
// Contest: Virtual Judge - The 3rd Universal Cup. Stage 8: Cangqian + The 3rd Universal Cup. Stage 7: Warsaw
// URL: https://vjudge.net/contest/658753#problem/F
// Memory Limit: 1014 MB
// Time Limit: 4000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define x first
#define y second 
#define endl '\n'
const LL maxn = 4e05+7;
const LL N = 5e05+10;
const LL mod = 1e09+7;
const int inf = 0x3f3f3f3f;
const LL llinf = 5e18;
typedef pair<int,int>pl;
priority_queue<LL , vector<LL>, greater<LL> >mi;//小根堆
priority_queue<LL> ma;//大根堆
void solve() 
{
	int n , k;
	cin >> n >> k;
	if(n > k){
		for(int i = 0 ; i < n ; i ++){
			int x , y;
			cin >> x >> y;
		}
		cout << "NIE\n";
		return;
	}
	else{
		vector< pair<int,int> >p[4];
		for(int i = 0 ; i < n ; i ++){
			int x , y;
			cin >> x >> y;
			if(x == -1 && y == -1){
				p[3].pb({x , y});
			}
			else if(x == -1){
				p[2].pb({y , x});
			}
			else if(y == -1){
				p[0].pb({x , y});
			}
			else{
				p[1].pb({x , y});
			}
		}
		for(int i = 0 ; i < 4 ; i ++){
			sort(p[i].begin() , p[i].end());
		}
		int st = 1;
		int cnt = 0;//可存放机动点的位置
		int pos[4];
		memset(pos , 0 , sizeof pos);
		while(1){
			if(pos[0] < p[0].size()){
				if(p[0][pos[0]].first < st){
					cout <<"NIE\n";
					return;
				}
				else if(p[0][pos[0]].first == st){
					pos[0]++;
					int mi = inf;
					if(pos[0] < p[0].size()){
						mi = min(mi , p[0][pos[0]].first);
					}
					if(pos[1] < p[1].size()){
						mi = min(mi , p[1][pos[1]].first);
					}
					if(pos[2] < p[2].size()){
						mi = min(mi , p[2][pos[2]].first);
					}
					if(mi == inf){
						cnt += k - st - 1;
						st = k + 1;
						break;
					}
					cnt += mi - st - 1;
					st = mi;
					continue;	
				}
			}
			if(pos[1] < p[1].size()){
				if(p[1][pos[1]].first < st){
					cout <<"NIE\n";
					return;
				}
				else if(p[1][pos[1]].first == st){
					int mi = p[1][pos[1]].second + 1;
					pos[1]++;
					st = mi;
					continue;	
				}
			}			
			if(pos[2] < p[2].size()){
				if(p[2][pos[2]].first < st){
					cout <<"NIE\n";
					return;
				}
				else if(p[2][pos[2]].first == st){
					st++;
					pos[2]++;
					continue;	
				}
			}
			if(pos[3] < p[3].size()){
				p[3].pop_back();
				int mi = inf;
				if(pos[0] < p[0].size()){
					mi = min(mi , p[0][pos[0]].first);
				}
				if(pos[1] < p[1].size()){
					mi = min(mi , p[1][pos[1]].first);
				}
				if(pos[2] < p[2].size()){
					mi = min(mi , p[2][pos[2]].first);
				}
				if(mi == inf){
					cnt += k - st - 1;
					st = k + 1;
					break;
				}		
				else{
					cnt += mi - st - 1;
					st = mi;
				}
				continue;		
			}
			break;
		}
		if(n == 200000){
			cout << p[3].size() << endl;
			cout << st << endl;
		}
		if(st != k + 1){
			cout << "NIE\n";
		}
		else if(cnt >= p[3].size()){
			cout <<"TAK\n";
		}
		else{
			cout <<"NIE\n";
		}
	}
}            
int main() 
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout.precision(10);
    int t=1;
	cin>>t;
    while(t--)
    {
    	solve();
    }
    return 0;
}