#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define sz(vec) ((ll)vec.size())
#define all(vec) vec.begin(),vec.end()
#define umap __gnu_pbds::gp_hash_table
using ll = long long;
using i128 = __int128;
using db = double;
#define Emu Smile
using namespace std;

void chmax(auto &a, auto b) { if (a < b) a = b; }
void chmin(auto &a, auto b) { if (a > b) a = b; }
inline int lbt(int x) { return x & (-x); }

const int P = 1e9+7, B = 1000;
const ll inf = 1e4;

void yes() {
	cout << "TAK\n";
}

void no() {
	cout << "NIE\n";
}

void solve() {
	int n; ll L; cin >> n >> L;
	ll ff = 0;
	vector<array<ll,3>> edge;
	for (int i = 0, x, y; i < n; ++i) {
		cin >> x >> y;
		if (x == -1 && y == -1) {
			ff ++;
		} else if (x == -1) {
			edge.push_back({y-1, y, 1});		// <-
		} else if (y == -1) {
			x --;
			edge.push_back({x, x+1, 2});	// ->
		} else {
			x --;
			edge.push_back({x, y, 0});
		}
	}
	n = sz(edge);
	if (n == 0) {
		if (ff <= L) return yes();
		else return no();
	}
	sort(all(edge), [&](array<ll,3> x, array<ll,3> y) {
		return x[0] < y[0];
	});
	int maxr = 0;
	for (int i = 0; i < n; ++i) {
		if (maxr > edge[i][0]) return no();
		chmax(maxr, edge[i][1]);
	}
	ll ffL = 0, ffR = 0;
	for (int i = 0; i < n; ++i) {
		if (edge[i][2] == 1) {
			int newl = 0;
			if (i > 0) newl = edge[i-1][1];
			ffR += edge[i][0] - newl;
			edge[i][0] = newl;
		} else if (edge[i][2] == 2) {
			int newr = L;
			if (i + 1 < n) newr = edge[i+1][0];
			ffR += newr - edge[i][1];
			edge[i][1] = newr;
		}
	}
	for (int i = 0; i < n; ++i) {
		int preR = 0;
		if (i > 0) preR = edge[i-1][1];
		if (preR != edge[i][0]) {
			ffL ++; ffR += edge[i][0] - preR;
		}
		int nxtL = L;
		if (i + 1 < n) nxtL = edge[i+1][0];
		if (nxtL != edge[i][1]) {
			ffL ++; ffR += nxtL - edge[i][1];
		}
	}
	if (ffL <= ff && ff <= ffR) {
		return yes();
	} else {
		return no();
	}
}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);

//	init();

	cout << fixed << setprecision(10);

	int OuO = 1;
	cin >> OuO;
	for (int piastic = 0; piastic < OuO; ++piastic) {
		solve();
	}
	return 0;
}