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

const int N = 200005;
int T, n, m, m2, L;
int l[N], r[N], lv[N], rv[N], perm[N];
bool cmp(int x, int y)
{
	return l[x] < l[y];
}

int main()
{
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d%d", &n, &L);
		m = m2 = 0;
		for (int i = 1; i <= n; i++)
		{
			perm[i] = i;
			scanf("%d%d", &lv[i], &rv[i]);
			if (lv[i] == -1 && rv[i] == -1)
				m2++;
			else if (lv[i] == -1)
			{
				m++;
				l[m] = r[m] = rv[i];
				lv[m] = 1;
				rv[m] = 0;
			}
			else if (rv[i] == -1)
			{
				m++;
				l[m] = r[m] = lv[i];
				lv[m] = 0;
				rv[m] = 1;
			}
			else
			{
				m++;
				l[m] = lv[i];
				r[m] = rv[i];
				lv[m] = rv[m] = 0;
			}
		}
		sort(perm + 1, perm + 1 + m, cmp);
		int mn = 0, mx = 0;
		bool ok = true;
		for (int i = 2; i <= m; i++)
		{
			int t = perm[i], t2 = perm[i - 1];
			if (l[t] <= r[t2]) ok = false;
			mx += l[t] - r[t2] - 1;
			if (!rv[t2] && !lv[t] && l[t] > r[t2] + 1)
				mn++;
		}
		mx += l[1] - 1;
		if (!lv[1] && l[1] > 1) mn++;
		mx += L - r[m];
		if (!rv[m] && r[m] < L) mn++;
		if (ok && m2 >= mn && m2 <= mx) printf("TAK\n");
		else printf("NIE\n");
	}
	return 0;
}