#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define X first
#define Y second
#define umap unordered_map
using ll = long long;
using ull = unsigned long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 2e5 + 5, mod = 1e9 + 7, maxp = 31, inf = 1e9;
const ll INF = 1e18;
const double eps = 1e-6;

struct node {
	int l, r, Min;
};

void solve() {
	int n, L;
	cin >> n >> L;

	int cnt = 0;

	vector<node> p;

	p.push_back({0, 0});

	vector<node> a(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i].l >> a[i].r;
		if(a[i].l == -1 && a[i].r == -1) {
			cnt += 1;
		} else if(a[i].l == -1) {
			a[i].Min = a[i].r;
		} else if(a[i].r == -1) {
			a[i].Min = a[i].l;
		} else {
			a[i].Min = min(a[i].l, a[i].r);
		}

		if(a[i].l != -1 || a[i].r != -1) {
			p.push_back({a[i].l, a[i].r, a[i].Min});
		}
	}

	//cout << "***" << p.size() << '\n';

	if(p.size() == 1) {
		if(n <= L) {
			cout << "TAK" << '\n';
		} else {
			cout << "NIE" << '\n';
		}
		return;
	}

	int siz = p.size() - 1;

	sort(p.begin() + 1, p.end(), [&](node x, node y) -> bool {
		return x.Min < y.Min;
	});

	int needNum = 0;
	int canNum = 0;

	for(int i = 1; i <= siz; i++) {
		if(p[i].l != -1 || p[i].r != -1) continue;
		if(p[i].l > p[i].r) {
			//cout << "@" << p[i].first << " " << p[i].second;
			return cout << "NIE" << '\n', void();
		}
	}

	for(int i = 1; i < siz; i++) {
		//cout << "@" << p[i].l << " " << p[i].r << '\n';
		int lft = p[i].r;
		int rgt = p[i + 1].l;
		if(lft != -1 && rgt != -1) {
			if(lft >= rgt) {
				return cout << "NIE" << '\n', void();
			}
			int dis = rgt - lft - 1;
			if(dis) {
				needNum += 1;
				canNum += dis;
			}
		} else if(lft == -1 && rgt == -1) {
			int dis = p[i + 1].r - p[i].l - 1;
			if(dis < 2) {
				return cout << "NIE" << '\n', void();
			}
			canNum += (dis - 2) / 2;
		} else if(lft == -1) {
			canNum += p[i + 1].r - p[i].l - 1;
		} else {
			canNum += p[i + 1].r - p[i].r - 1;
		}
		//cout << "canNum" << canNum << '\n';
	}

	if(p[1].l != 1) {
		if(p[1].l == -1) {
			canNum += p[1].r - 1;
		} else {
			needNum += 1;
			canNum += p[1].l - 1;
		}
	}

	if(p[siz].r != L) {
		if(p[siz].r == -1) {
			canNum += L - p[siz].l;
		} else {
			needNum += 1;
			canNum += L - p[siz].r;
		}
	}

	if(cnt >= needNum && cnt <= canNum) {
		cout << "TAK" << '\n';
	} else {
		//cout << "&" << cnt << " " << needNum << " " << canNum << '\n';
		cout << "NIE" << '\n';
	}

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt = 1;
    cin >> tt;
    while (tt--) solve();
    return 0;
}