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
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <utility>
#include <list>

typedef long long int ll;
using namespace std;

#define _d(fmt, ...) \
	            do { if (0) fprintf(stderr, fmt, __VA_ARGS__); } while (0)



int main() {
	int i, j, n, t, w1, w2, h1, h2, czy_ok = 0;
	scanf("%d", &t);
	for (i = 0; i < t; ++i) {
		scanf("%d", &n);
		int max_w = 0, min_w = 1000000000, 
		    max_h = 0, min_h = 1000000000;
		for (j = 0; j < n; ++j) {
			scanf("%d %d %d %d", &w1, &w2, &h1, &h2);
			if (w1 < min_w) {
				min_w = w1;
				czy_ok = 0;
			}
			if (w2 > max_w) {
				max_w = w2;
				czy_ok = 0;
			}
			if (h1 < min_h) {
				min_h = h1;
				czy_ok = 0;
			}
			if (h2 > max_h) {
				max_h = h2;
				czy_ok = 0;
			}
			if (w1 <= min_w && w2 >= max_w && h1 <= min_h && h2 >= max_h)
				czy_ok = 1;
		}
		printf("%s\n", czy_ok ? "TAK" : "NIE");
	}

	return 0;
}
/* vim: ts=2 noet */