//https://contest.ucup.ac/contest/1774/problem/9221
#include<bits/stdc++.h>
using namespace std;

using u64 = unsigned long long;
using u32 = unsigned int;
using i64 = long long;

mt19937_64 rnd(random_device{}());

const int mod = 998244353;
const int N = 3e5 + 5;
const int M = 2e5 + 5;

int n, m, s, t;

struct segment {
	int l, r, min;
};

int L;

void RuinGuard(int tc)
{
	cin >> n >> L;
	
	int cnt = 0;
	
	vector<segment> seg(1, {0, 0, 0});
	for(int i = 1; i <= n; i++) {
		int ll, rr;
		cin >> ll >> rr;
		if(ll == -1 && rr == -1) {
			cnt += 1;
		} else if(ll == -1) {
			seg.push_back({ll, rr, rr});
		} else if(rr == -1) {
			seg.push_back({ll, rr, ll});
		} else {
			seg.push_back({ll, rr, min(ll, rr)});
		}
	}
	
	int siz = seg.size() - 1;
	
	if(!siz) {
		if(n <= L) {
			return cout << "TAK\n", void();
		} else {
			return cout << "NIE\n", void();
		}
	}
	
	sort(seg.begin() + 1, seg.end(), [&](segment& a, segment& b) -> bool {
		return a.min < b.min;
	});
	
	for(int i = 1; i <= siz; i++) {
		if(seg[i].l == -1 || seg[i].r == -1) continue;
		if(seg[i].l > seg[i].r) {
			return cout << "NIE\n", void();
		}
	}
	
	int needNum = 0, canNum = 0;
	
	if(seg[1].l != 1) {
		if(seg[1].l == -1) {
			canNum += seg[1].r - 1;
		} else {
			needNum += 1;
			canNum += seg[1].l - 1;
		}
	}
	
	for(int i = 1; i < siz; i++) {
		if(seg[i].min == seg[i + 1].min) {
			return cout << "NIE\n", void();
		}
		int lft = seg[i].r, rgt = seg[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) {
			needNum += rgt - seg[i].l - 1;
		} else {
			needNum += seg[i + 1].r - lft - 1;
		} 
	}
	
	if(seg[siz].r != L) {
		if(seg[siz].r == -1) {
			canNum += L - seg[siz].l;
		} else {
			needNum += 1;
			canNum += L - seg[siz].r;
		}
	}
	
	if(cnt >= needNum && cnt <= canNum) {
		return cout << "TAK\n", void();
	} else {
		return cout << "NIE\n", void();
	}
}

signed main()
{ 
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int testcase = 1;
	cin >> testcase;
	
    for(int tc = 1; tc <= testcase; tc++) {
    	RuinGuard(tc);
	}

    return 0;
}