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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.StringTokenizer;

public class par {

	private int N;
	private int H;
	private ArrayList<Car> initial;
	private ArrayList<Car> fin;
	private IntervalTree it;
	private int[] map;

	public par() {
		readData();

		if (N == 1) {
			Writer.print("TAK\n");
			return;
		}

		sort(initial);

		createMapping();

		createIT();

		sort(fin);

		for (int i = 0; i < N; ++i) {
			int b = fin.get(i).height;
			int aix = map[fin.get(i).name];
			int a = it.getMax(aix - 1);
			if (a + b > H) {
				Writer.print("NIE\n");
				return;
			}
			it.update(aix, 0);
		}
		Writer.print("TAK\n");
	}

	private void createIT() {
		it = new IntervalTree(N);
		for (int i = 0; i < N; ++i)
			it.update(i, initial.get(i).height);
	}

	private void createMapping() {
		map = new int[N];
		for (int i = 0; i < N; ++i)
			map[initial.get(i).name] = i;
	}

	private void sort(ArrayList<Car> list) {
		Collections.sort(list, new Comparator<Car>() {
			@Override
			public int compare(Car o1, Car o2) {
				return o1.position.compareTo(o2.position);
			}
		});
	}

	private void readData() {
		this.N = Reader.nextInt();
		this.H = Reader.nextInt();

		readCars(initial = new ArrayList<Car>(N));
		readCars(fin = new ArrayList<Car>(N));
	}

	private void readCars(ArrayList<Car> list) {
		for (int i = 0; i < N; ++i) {
			int x0 = Reader.nextInt();
			int y0 = Reader.nextInt();
			int x1 = Reader.nextInt();
			int y1 = Reader.nextInt();
			list.add(new Car(i, Math.min(x0, x1), Math.abs(y1 - y0)));
		}
	}

	public static class IntervalTree {
		int[][] maxs;
		private int N;
		private int H;

		public IntervalTree(int N) {
			this.H = (int) (Math.log10(N - 1) / Math.log10(2)) + 2;
			H = Math.max(H, 1);
			this.N = (int) Math.pow(2, H);
			maxs = new int[H][this.N];
		}

		public void update(int x, int v) {
			update(H - 1, x, v);
		}

		private void update(int y, int x, int v) {
			if (y < 0 || maxs[y][x] == v)
				return;

			maxs[y][x] = v;

			int x2 = (x & 1) == 0 ? x + 1 : x - 1;
			update(y - 1, x / 2, Math.max(v, maxs[y][x2]));
		}

		private int getMax(int x) {
			if (x < 0)
				return 0;
			return getMax(H - 1, x);
		}

		private int getMax(int y, int x) {
			if (x < 0 || y < 0)
				return 0;

			return Math.max(maxs[y][x], (x & 1) == 1 ? getMax(y - 1, x / 2) : getMax(y, x - 1));
		}
	}

	public static class Car {
		Integer name, position, height;

		public Car() {
		}

		public Car(Integer name, Integer pos, Integer height) {
			this.name = name;
			this.position = pos;
			this.height = height;
		}

		public String toString() {
			return "(" + name + "," + position + "," + height + ")";
		}
	}

	public static void main(String[] args) {
		Reader.init(System.in);
		for (int n = Reader.nextInt(); n > 0; --n)
			new par();

		Writer.flush();

	}

	// =========================
	// based on @author: http://www.rgagnon.com/javadetails/java-0603.html
	static class Writer {
		private static BufferedWriter out;

		static {
			out = new BufferedWriter(new OutputStreamWriter(System.out), 512);
		}

		static void print(char c) {
			try {
				out.write(c);
			} catch (IOException e) {
				e.printStackTrace();
			}
		}

		static void print(String str) {
			try {
				out.write(str);
			} catch (IOException e) {
				e.printStackTrace();
			}
		}

		static void println() {
			try {
				out.write("\n");
			} catch (IOException e) {
				e.printStackTrace();
			}
		}

		static void flush() {
			try {
				out.flush();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}

		@Override
		protected void finalize() {
			try {
				out.flush();
			} catch (IOException e) {
				e.printStackTrace();
			}
		}
	}

	// =========================
	// based on @author: http://www.cpe.ku.ac.th/~jim/java-io.html
	static class Reader {
		static BufferedReader reader;
		static StringTokenizer tokenizer;

		static void init(InputStream input) {
			reader = new BufferedReader(new InputStreamReader(input));
			tokenizer = new StringTokenizer("");
		}

		static String next() {
			try {
				while (!tokenizer.hasMoreTokens()) {
					String str;
					str = reader.readLine();
					if (str == null)
						return null;
					tokenizer = new StringTokenizer(str);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			return tokenizer.nextToken();
		}

		static int nextInt() {
			try {
				return Integer.parseInt(next());
			} catch (NumberFormatException e) {
				e.printStackTrace();
			}
			return -1;
		}

		static double nextDouble() {
			try {
				return Double.parseDouble(next());
			} catch (NumberFormatException e) {
				e.printStackTrace();
			}
			return -1;
		}
	}
	// =========================
}