// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\33[32m[" << __LINE__ << "]\33[m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T &x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T &x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = - f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = 2e5 + 10;
int n, l;
pair <int, int> a[N];
void zhk() {
	read(n), read(l);
	int s = 0;
	F(i, 1, n) {
		read(a[i].first), read(a[i].second);
		if (a[i].first == - 1 && a[i].second == - 1) {
			s++;
			i--;
			n--;
			continue;
		}
	}
	a[++n] = make_pair(l + 1, l + 1);
	sort(a + 1, a + n + 1, [&] (pair <int, int> x, pair <int, int> y) {
		return max(x.first, x.second) < max(y.first, y.second);
	});
	int l = 0, r = 0, p = 0;
	bool flag = false;
	F(i, 1, n) {
		if (a[i].first == - 1) {
			if (a[i].second <= p) {
				puts("NIE");
				return;
			}
			r += a[i].second - p - 1;
			p = a[i].second;
		} else {
			if (a[i].first <= p) {
				puts("NIE");
				return;
			}
			if (!flag) {
				if (a[i].first != p + 1) {
					l++, r += a[i].first - p - 1;
				}
			} else {
				r += a[i].first - p - 1;
			}
			if (a[i].second == - 1) {
				p = a[i].first;
				flag = true;
			} else {
				p = a[i].second;
				flag = false;
			}
		}
	}
	if (l <= s && s <= r) puts("TAK");
	else puts("NIE");
}
signed main() {
	int _ = 1;
	cin >> _;
	while (_--) zhk();
	return 0;
}
/* why?
*/