#include <bits/stdc++.h>
#define rep(x, l, r) for(int x = l; x <= r; x++)
using namespace std;

const int MAXN = 2e5 + 5;

struct node{
	int l, r, f1, f2;
} a[MAXN];

bool cmp(node a, node b){
	return max(a.l, a.r) < max(b.l, b.r);
}

int main(){
	int t;
	scanf("%d", &t);
	while(t--){
		int n, L;
		scanf("%d%d", &n, &L);
		rep(i, 1, n) a[i].f1 = a[i].f2 = 0;
		rep(i, 1, n){
			scanf("%d%d", &a[i].l, &a[i].r);
			if(a[i].l == -1){
				a[i].f1 = 1;
				a[i].l = a[i].r;
			}
			if(a[i].r == -1){
				a[i].f2 = 1;
				a[i].r = a[i].l;
			}
		}
		sort(a + 1, a + n + 1, cmp);
		int x = 0;
		while(a[x + 1].l == -1 && a[x + 1].r == -1) x++;
		int mn = 0, mx = 0, ans = 1;
		int pre = 0;
		a[n + 1].l = a[n + 1].r = L + 1;
		rep(i, x + 1, n + 1){
			if(pre >= a[i].l){
				ans = 0;
				break;
			}
			if(pre < a[i].l - 1){
				mx += a[i].l - 1 - pre;
				if((i == n + 1 || !a[i].f1) && (i == x + 1 || !a[i - 1].f2)) mn++;
			}
			pre = a[i].r;
		}
		if(ans && x >= mn && x <= mx) puts("TAK");
		else puts("NIE");
	}
	return 0;
}