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
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back

#define M 1000000007
#define INF 1000000007

using namespace std;

int n;

struct lustro
{
    int a, b, c, d;
};
lustro tab[1000007];

bool sprawdz()
{
    FOR(i, 1, n-1)
    {
//        cout << "porownuje " << tab[0].a << ", " << tab[0].b << ", " << tab[0].c << ", " << tab[0].d << " z " << tab[i].a << ", " << tab[i].b << ", " << tab[i].c << ", " << tab[i].d << endl;
        if(tab[0].a > tab[i].a || tab[0].b < tab[i].b || tab[0].c > tab[i].c || tab[0].d < tab[i].d)
        {
            return 0;
        }
    }
    return 1;
}

int main()
{
    testy()
    {
        scanf("%d", &n);
        forr(i, n)
        {
            scanf("%d %d %d %d", &tab[i].a, &tab[i].b, &tab[i].c, &tab[i].d);
            if(tab[i].a < tab[0].a ||
               tab[i].a == tab[0].a && tab[i].c < tab[0].c ||
               tab[i].a == tab[0].a && tab[i].c == tab[0].c && tab[i].b > tab[0].b ||
               tab[i].a == tab[0].a && tab[i].c == tab[0].c && tab[i].b == tab[0].b && tab[i].d > tab[0].d)
                tab[0] = tab[i];
        }

        printf(sprawdz() ? "TAK\n" : "NIE\n");
    }

	return 0;
}