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
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
//Krzysztof Pieprzak
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <deque>
#include <stack>
#include <map>
#include <ctime>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

#define Size(x) (int)x.size()
#define VAR(v,n) typeof(n)v = (n)
#define FOR(i,a,b) for(VAR(i,a); i < (b); ++i)
#define FORE(i,a,b) for(VAR(i,a); i <= (b); ++i)
#define FORREV(i,a,b) for(VAR(i,b); i >= (a); --i)
#define FORSTEP(i,a,b,step) for(VAR(i,a); i < (b); i += (step))
#define FOREACH(i,c) for(VAR(i,(c).begin()); i != (c).end(); ++i)
#define ALL(x) x.begin(),x.end()
#define CLEAR(t) memset(t, 0, sizeof(t))
#define F first
#define S second
#define MP make_pair
#define PUB push_back
#define POB pop_back
#define pieprzu ios_base::sync_with_stdio(0);

#define h(x) (tBg[(x)].y2-tBg[(x)].y1)

const int    INF = 1000000001;
const double EPS = 10e-9;

const int MAXN = 50005;
const int MAXLOGN = 16;

struct Rect
{
    int x1,y1;
    int x2,y2;
    int id;
};

int tree[(1<<(MAXLOGN+1))+5];//no need to clear
int start;

Rect tBg[MAXN];//no need to clear
Rect tEd[MAXN];//no need to clear

int ids[MAXN];//no need to clear
int order[MAXN];//no need to clear

int n;
int w;

inline void readTab(Rect *t)
{
    FOR (i, 0, n)
    {
        scanf("%d %d %d %d", &t[i].x1, &t[i].y1, &t[i].x2, &t[i].y2);
        t[i].id = i;
    }
}

inline void read()
{
    scanf("%d %d", &n, &w);
    readTab(tBg);
    readTab(tEd);
}

bool cmp(const Rect &a, const Rect &b)
{
    return a.x1 < b.x1;
}

inline void normalize(Rect *t)
{
    FOR (i, 0, n)
    {
        if (t[i].x1 > t[i].x2) swap(t[i].x1,t[i].x2);
        if (t[i].y1 > t[i].y2) swap(t[i].y1,t[i].y2);
    }

    sort(t,t+n,cmp);
}

inline void setOrder()
{
    FOR (i, 0, n) ids[tBg[i].id] = i;
    FOR (i, 0, n) order[i] = ids[tEd[i].id];
}

//TREE
inline void treeCreate()
{
    for (start=1; start<n; start<<=1);

    FOR (i, 0, start) tree[start+i] = h(i);
    FORREV (i, 1, start-1) tree[i] = max(tree[i<<1],tree[i<<1|1]);
}

inline int treeGetMax(int v)
{
    int res = 0;

    for (v += start; v > 1; v >>= 1)
        if (v&1)
            res = max(res,tree[v-1]);

    return res;
}

inline void treeRemove(int v)
{
    v += start;
    tree[v] = 0;

    for (v >>= 1; v > 1; v >>= 1)
        tree[v] = max(tree[v<<1],tree[v<<1|1]);
}

inline bool moveBgToEd()
{
    int id;
    FOR (i, 0, n)
    {
        id = order[i];
        if (treeGetMax(id) > w-h(id)) return false;
        treeRemove(id);
    }

    return true;
}

inline void rob()
{
    read();

    normalize(tBg);
    normalize(tEd);

    treeCreate();

    setOrder();

    if (moveBgToEd()) printf("TAK\n");
    else printf("NIE\n");
}

int main()
{
    int test = 1;
    scanf("%d", &test);

    while (test--) rob();

    return 0;
}