#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, L;
pair<int, int> a[N];
vector<pair<int, int> > b;
map<int, bool> mark;
multiset<int> s;
void reinit() {
	b.clear();
	mark.clear();
	s.clear();
}
void solve() {
	cin >> n >> L;
	bool ok = 1;
	int cnt = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].first >> a[i].second;
	}
	sort(a + 1, a + 1 + n);
	for (int i = 1; i <= n; ++i) {
		if (a[i].first != -1 && a[i].second != -1 && !s.empty() && *--s.end() >= a[i].first) {
			int tmp = *s.lower_bound(a[i].first);
			if (tmp <= a[i].second) ok = 0;
		}
		if (a[i].first != -1) {
			s.insert(a[i].first);
			b.push_back({a[i].first, 0});
			mark[a[i].first] = 1;
		}
		if (a[i].second != -1) {
			s.insert(a[i].second);
			b.push_back({a[i].second, 1});
			mark[a[i].second] = 1;
		}
		if (a[i].first != -1 && a[i].second != -1) {
			mark[a[i].first] = mark[a[i].second] = 1;
			if (a[i].first < a[i].second) mark[a[i].first + 1] = mark[a[i].second - 1] = 1;
		}
		if (a[i].first == -1 && a[i].second == -1) ++cnt;
	}
	sort(b.begin(), b.end());
	int mn = 0, pre = 0;
	for (auto &i : b) {
		int pos = i.first, type = i.second;
		if (pos == pre) ok = 0;
		if (pos > 1 && type == 0 && !mark[pos - 1]) ++mn;
		// cerr << "DB>> " << pos << " : " << mn << '\n';
		pre = pos;
	}
	int mx = L - b.size();
	// cerr << "DB>> " << mn << ' ' << mx << '\n';
	if (b.back().first < L && b.back().second == 1) ++mn;
	if (ok && mn <= cnt && cnt <= mx) cout << "TAK\n";
	else cout << "NIE\n";
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifdef LOCAL
	    // freopen("TEST.inp", "r", stdin);
	    // freopen("TEST.out", "w", stdout);
    #else
    	// freopen("TEST.inp", "r", stdin);
    	// freopen("TEST.out", "w", stdout);
    #endif
 	int t;
 	cin >> t;
 	while (t--) {
 		solve();
 		reinit();
 	}   
    return 0;
}