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
#include <iostream>
#include <climits>

using namespace std;

enum dim {
	LW, HW, LH, HH, DIM
};

const int max_fact = 100000;

int fact[max_fact][DIM];
int bound[DIM];

void one_case() {
	int factc;
	bool exist = false;

	bound[LW] = INT_MAX;
	bound[LH] = INT_MAX;
	bound[HW] = INT_MIN;
	bound[HH] = INT_MIN;

	cin >> factc;

	for (int i = 0; i < factc; ++i) {
		for (int j = 0; j < DIM; ++j) {
			cin >> fact[i][j];
		}

		if (fact[i][LH] < bound[LH]) {
			bound[LH] = fact[i][LH];
		}

		if (fact[i][LW] < bound[LW]) {
			bound[LW] = fact[i][LW];
		}

		if (fact[i][HH] > bound[HH]) {
			bound[HH] = fact[i][HH];
		}

		if (fact[i][HW] > bound[HW]) {
			bound[HW] = fact[i][HW];
		}
	}

	for (int i = 0; i < factc; ++i) {
		if (fact[i][LH] == bound[LH] && fact[i][HH] == bound[HH]
				&& fact[i][LW] == bound[LW] && fact[i][HW] == bound[HW]) {
			exist = true;
			break;
		}
	}

	cout << (exist ? "TAK" : "NIE") << endl;
}

int main() {
	int tc;

	ios_base::sync_with_stdio(0);

	cin >> tc;
	while (tc--) {
		one_case();
	}

	return 0;
}