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
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <iterator>
#include <algorithm>

using namespace std;

int main() {
	std::ios_base::sync_with_stdio (false);

	int count;
	int curiter;
	
	cin >> count;

	for (int i = 0; i < count; ++i) {
		cin >> curiter;

		long first;
		long second;
		long third;
		long fourth;

		long minfirst;
		long maxsecond;
		long minthird;
		long maxfourth;

		cin >> minfirst;
		cin >> maxsecond;
		cin >> minthird;
		cin >> maxfourth;

		bool ismajorizer = true;

		for (int j = 1; j < curiter; ++j) {

			cin >> first;
			cin >> second;
			cin >> third;
			cin >> fourth;
			
			if ((first <= minfirst) && (second >= maxsecond) && (third <= minthird) && (fourth >= maxfourth)) {
				ismajorizer = true;
				minfirst = first;
				maxsecond = second;
				minthird = third;
				maxfourth = fourth;
			} else if ((first >= minfirst) && (second <= maxsecond) && (third >= minthird) && (fourth <= maxfourth)) {
				// nothing 				
			} else {
				ismajorizer = false;
				if (first < minfirst)
					minfirst = first;
				if (second > maxsecond)
					maxsecond = second;
				if (third < minthird)
					minthird = third;
				if (fourth > maxfourth)
					maxfourth = fourth;
			}
		}

		if (ismajorizer) {
			cout << "TAK" << endl;
		} else {
			cout << "NIE" << endl;
		}
	}

}