1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include <iostream>
#include <algorithm>

using namespace std;

struct car { int x, h, id; };

car pre[50000];
car pos[50000];
int ord[50000];
int mxh[50000];
bool mgd[50000];
int tmp[50000];

bool operator< (car a, car b) {
	return a.x < b.x;
}

int abs(int x) {
	if (x < 0)
		return -x;
	return x;
}

car norm(int x1, int y1, int x2, int y2, int id) {
	car c;
	c.x = min(x1, x2);
	c.h = abs(y1 - y2);
	c.id = id;
	return c;
}

int n, ph;
bool status;

void merge (int s, int m, int t) {
	for (int i = s; i < m; i++) {
		mgd[ord[i]] = false;
	}

	int a = 0, b = 0, c = 0;

	for (int i = s; i < t; i++) {
		if (s + a == m) {
			tmp[i] = ord[m+b];
			b++;
		} else if (m + b == t) {
			tmp[i] = ord[s+a];
			mgd[ord[s+a]] = true;
			a++;
		} else {
			if (pos[ord[s+a]].x <= pos[ord[m+b]].x) {
				tmp[i] = ord[s+a];
				mgd[ord[s+a]] = true;
				a++;
			} else {
				int ch = pos[ord[m+b]].h;
				while (mgd[mxh[s+c]]) {
					c++;
				}
				int mxrh = pos[mxh[s+c]].h;
				if (mxrh + ch > ph) {
					status = false;
					return;
				}

				tmp[i] = ord[m+b];
				b++;
			}
		}
	}

	for (int i = s; i < t; i++) {
		ord[i] = tmp[i];
	}

	a = b = 0;
	for (int i = s; i < t; i++) {
		if (s + a == m) {
			tmp[i] = mxh[m+b];
			b++;
		} else if (m + b == t) {
			tmp[i] = mxh[s+a];
			a++;
		} else {
			if (pos[mxh[s+a]].h >= pos[mxh[m+b]].h) {
				tmp[i] = mxh[s+a];
				a++;
			} else {
				tmp[i] = mxh[m+b];
				b++;
			}
		}
	}

	for (int i = s; i < t; i++) {
		mxh[i] = tmp[i];
	}
}

void mergesort(int s, int t) {
	if (s + 1 == t) {
		return;
	}

	int m = (s+t)/2;
	mergesort(s, m);
	if (!status) { return; }
	mergesort(m, t);
	if (!status) { return; }
	merge(s, m, t);
}

int main() {
	ios_base::sync_with_stdio(0);
	int z;
	cin >> z;
	while (z--) {
		cin >> n >> ph;
		status = true;

		int x1, y1, x2, y2;
		for (int i = 0; i < n; i++) {
			cin >> x1 >> y1 >> x2 >> y2;
			pre[i] = norm(x1, y1, x2, y2, i);
		}
		for (int i = 0; i < n; i++) {
			cin >> x1 >> y1 >> x2 >> y2;
			pos[i] = norm(x1, y1, x2, y2, i);
		}

		sort(pre, pre + n);

		for (int i = 0; i < n; i++) {
			ord[i] = pre[i].id;
			mxh[i] = pre[i].id;
			mgd[i] = true;
		}

		mergesort(0, n);

		cout << (status ? "TAK" : "NIE") << endl;
	}
	return 0;
}