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
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define VAR(n,v) typeof(v) n=(v)
#define REP(i,n) for(int i=1; i<=(n); ++i)
#define FOR(i,a,b) for(VAR(i,a); i!=(b); ++i)
#define FORE(it,t) FOR(it,t.begin(),t.end())
typedef vector<int> vi;
#define pb push_back
typedef pair<int,int> pii;
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
#define INF 1000000001
#define sz size()
#define ALL(t) (t).begin(),(t).end()
#define SC(a) scanf("%d", &a)
#define GET(a) int a; SC(a)
#define ISDEBUG 0
#define dprintf(...) if(ISDEBUG) \
	{printf("\033[31m"); printf(__VA_ARGS__); printf("\033[0m");}
template <class It> void dptab(It b, It e, const char* f="%d ")
	{if(ISDEBUG) {for(It it=b; it!=e; ++it) dprintf(f, *it); dprintf("\n"); }}

pii combine(const vector<pii>& t) {
	pii res = t.front();
	for(auto& p: t)
		res = mp(min(res.st, p.st), max(res.nd, p.nd));
	dprintf("%d %d\n", res.st, res.nd);
	return res;
}

bool better(const pii& p, const pii& cp) {
	return p.st<=cp.st && cp.nd<=p.nd;
}

bool test() {
	GET(n);
	vector<pii> w(n), h(n);
	FOR(i,0,n)
		scanf("%d%d%d%d", &w[i].st, &w[i].nd, &h[i].st, &h[i].nd);
	pii cw = combine(w), ch = combine(h);
	FOR(i,0,n)
		if(better(w[i], cw) && better(h[i], ch))
			return true;
	return false;
}

int main() {
	GET(t);
	while(t--)
		puts(test() ? "TAK" : "NIE");
}