#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
inline ll read() {
	ll x=0;
	char ch=getchar();
	bool f=0;
	for (; !isdigit(ch); ch=getchar()) if (ch=='-') f=1;
	for (; isdigit(ch); ch=getchar()) x=x*10+ch-'0';
	return f?-x:x;
}
void write(ll x) {
	if (x<0) putchar('-'),x=-x;
	if (x>=10) write(x/10);
	putchar(x%10+'0');
}
void writeln(ll x) {
	write(x);
	putchar('\n');
}
void writep(ll x) {
	write(x);
	putchar(' ');
}

int const N=2e5+3;
int t,n,m,l;
struct node {
	int l,r;
} a[N],b[N];

bool cmp(node A,node B) {
	return max(A.l,A.r)<max(B.l,B.r);
}

int main() {
	t=read();
	while (t--) {
		n=read();
		l=read();
		m=0;
		for (int i=1; i<=n; i++) {
			b[i].l=read();
			b[i].r=read();
			if (b[i].l!=-1 || b[i].r!=-1) a[++m].l=b[i].l,a[m].r=b[i].r;
		}
		sort(a+1,a+m+1,cmp);
		int pos=1,flag=0,tot=l;
		for (int i=1; i<=m; i++) {
			if (a[i].l!=-1 && pos>a[i].l) {
				flag=1;
				break;
			}
			if (a[i].l!=-1 && a[i].r!=-1) tot-=a[i].r-a[i].l+1;
			else tot--;
			pos=max(a[i].l,a[i].r)+1;
		}
		if (flag || tot<n-m) puts("NIE");
		else puts("TAK");
	}
}