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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
#include <iostream>
#include <vector>
#include <functional>
#include <algorithm>
using namespace std;


#ifdef _WIN32

int inp()
{
	int n = 0;
	int ch = _fgetc_nolock(stdin);
	if (ch <= ' ') ch = _fgetc_nolock(stdin);
	while (ch > ' ') {
		n = 10 * n + ch - 48;
		ch = _fgetc_nolock(stdin);
	}
	return n;
}

#elif __linux

int inp()
{
	int n = 0;
	int ch = getchar_unlocked();
	if (ch <= ' ') ch = getchar_unlocked();
	while (ch > ' ') {
		n = 10 * n + ch - 48;
		ch = getchar_unlocked();
	}
	return n;
}

#endif

long long Height;

class Car {
public:
	static int counter;

	int ident;
	long long H;
	long long Pos;

	Car() {
	}

	Car(long long H, long long Pos) {
		this->H = H;
		this->Pos = Pos;
		this->ident = ++counter;
	}

	static void resetCounter() {
		counter = 0;
	}

	int operator==(const Car &c) const { 
		return ident == c.ident; 
	}
};

int Car::counter = 0;



struct compareCar_functor
{
	bool operator()(const Car& x, const Car& y) const
	{
		return x.Pos < y.Pos;
	}
};

bool compareCar(Car x, Car y)
{
	return x.Pos < y.Pos;
}

void process() {
	int n;

	n = inp();
	Height = inp();

	vector<Car> start;
	vector<Car> finish;

	int Pos;
	int H;
	int temp;

	for (int j = 0; j < n; j++) {

		Pos = inp();
		H = -inp();
		temp = inp();
		H += inp();

		start.push_back(Car(H, Pos));

	}

	Car::resetCounter();

	make_heap(start.begin(), start.end(), compareCar_functor());
	sort_heap(start.begin(), start.end(), compareCar_functor());

	for (int j = 0; j < n; j++) {

		Pos = inp();
		H = -inp();
		temp = inp();
		H += inp();

		finish.push_back(Car(H, Pos));

	}

	Car::resetCounter();

	//make_heap(finish.begin(), finish.end(), compareCar_functor());
	//sort_heap(finish.begin(), finish.end(), compareCar_functor());

	// Teraz przypisuje nowe pozycje
	for (vector<Car>::iterator it = start.begin(); it != start.end(); ++it) {

		vector<Car>::iterator found = find_if(finish.begin(), finish.end(), bind1st(equal_to<Car>(), *it));

		(*it).Pos = (*found).Pos;
	}

	/*
	for (vector<Car>::iterator it = start.begin(); it != start.end(); ++it) {
		cout << (*it).ident << ":" << (*it).Pos << ":" << (*it).H << endl;
	}
	*/

	int size = start.size();

	for (int j = 0; j < size; j++) {

		// Musze wziąć min pos
		// A potem przesuwać w lewo


		vector<Car>::iterator found = min_element(start.begin(), start.end(), compareCar);

		if (found == start.begin()) {
			//cout << (*found).ident << ":" << (*found).Pos << " " << endl;
			start.erase(found);
			continue;
		}

		for (vector<Car>::iterator it = found - 1; it != start.begin(); --it) {

			if ((*found).H + (*it).H > Height) {
				cout << "NIE" << endl;
				return;
			}

			iter_swap(it, found);
			found = it;
			
		}

		if ((*found).H + (*start.begin()).H > Height) {
			cout << "NIE" << endl;
			return;
		}

		iter_swap(start.begin(), found);


		//cout << (*found).ident << ":" << (*found).Pos << " " << endl;
		start.erase(found);

	}

	cout << "TAK" << endl;
}


int main() {

	int t;
	t = inp();

	for (int i = 0; i < t; i++) {

		process();
		
	}



	return 0;
}