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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int INF=INT_MAX;
const int MAXN=50000+1;

int maxh[18][MAXN];
int nodes[18];

int n, w, t;

struct car {
    int x;
    int i;
};

car dest[MAXN];
car orig[MAXN];

int h[MAXN];
int car_pos[MAXN];

int cmp (const void * a, const void * b)
{
    return ( ((car*)a)->x - ((car*)b)->x );
}

int getUpNode(int i){
    if (i&1){
        return i>>1;
    }
    return (i>>1)-1;
}

int getMax(int i) {
    int m=0;
    int l=0;
    while (i>=0) {
        m=max(m,maxh[l][i]);
        i=getUpNode(i);
        l++;
    }
    return m;
}

void rmNode(int i) {
    maxh[0][i]=0;
    int l=1;
    i/=2;
    while (nodes[l]>=i) {
        maxh[l][i]=max(maxh[l-1][i*2],maxh[l-1][(i*2)+1]);
        i/=2;
        l++;
        
        assert(l<20);
    }
}

void printTree(){
    printf("\n");
    int li=0;
    while (nodes[li]>=0) {
        FOR(lni,0,nodes[li]){
            printf("%d ",maxh[li][lni]);
        }
        li++;
        printf("\n");
    }
    printf("\n");
}

int main() {
    //ios_base::sync_with_stdio(0);
    
    SI(t);
    
    REP(ti, t) {
        bool result=true;
        
        SI(n);
        SI(w);
        
        int x1,y1,x2,y2;
        REP(i, n) {
            SI(x1);
            SI(y1);
            SI(x2);
            SI(y2);
            
            h[i]=abs(y1-y2);
            
            orig[i].x=min(x1,x2);
            orig[i].i=i;
        }
        REP(i, n) {
            SI(x1);
            SI(y1);
            SI(x2);
            SI(y2);
            
            dest[i].x=min(x1,x2);
            dest[i].i=i;
            
        }
        
        qsort(dest, n, sizeof(dest[0]), cmp);
        qsort(orig, n, sizeof(orig[0]), cmp);

//        REP(i,n) {
//            printf("%d\n",orig[i].i);
//        }
//        REP(i,n) {
//            printf("%d\n",dest[i].i);
//        }
        REP(i,n) {
            int ci=orig[i].i;

            car_pos[ci]=i;
            maxh[0][i]=h[ci];
        }
        
        int ni=n-1;
        nodes[0]=ni;
        int li=0;
        while (ni>0) {
            li++;
            nodes[li]=ni=getUpNode(ni);
            FOR(lni,0,ni){
                maxh[li][lni]=max(maxh[li-1][lni*2],maxh[li-1][(lni*2)+1]);
            }
        }
        assert(getUpNode(0)==-1);
        nodes[++li]=-1;
        
//        printTree();
        
        FOR(i,0,n-1){
            
            int ci=dest[i].i;
            int cp=car_pos[ci];
            
//            printf("%d %d %d\n",dest[i].i,getMax(cp-1),h[ci]);
            
                if (getMax(cp-1)+h[ci]>w) {
                    result=false;
                    break;
                }
            
            rmNode(cp);
            
//            printTree();
        }
        
        
        if (result) {
            printf("TAK\n");
        } else {
            printf("NIE\n");
        }
        
        
    }
    
    
    
	return 0;
}