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
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>

using namespace std;

typedef long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

/** Piotr Stanczyk "Algorytmika praktyczna" */

const int INF = 1000000001;
struct MaxTree {
    int* el, s;
    MaxTree(int size) {
	el = new int[2*(s = 1<<size)];
	REP(x,2*s) el[x]=0;
    }
    ~MaxTree(){delete[] el;}
    void Set(int p,int v) {
	for(p+=s, el[p]=v, p>>=1; p>0; p>>=1)
	    el[p] = max(el[p<<1], el[(p<<1)+1]);
    }
    int Find(int p, int k) {
	int m = -INF;
	p+=s; k+=s;
	while(p<k) {
	    if((p&1)==1) m=max(m,el[p++]);
	    if((k&1)==0) m=max(m,el[k--]);
	    p>>=1; k>>=1;
	}
	if(p==k) m=max(m,el[p]);
	return m;
    }
};

/** END */

struct s
{
	int y;
	int x_in;
	int x_fin;
	int idx_fin;
	int breaker;
};

bool comp_x_in (s i, s j)
{
	if(i.x_in == j.x_in)
	{
		return i.breaker < j.breaker;
	}
	return i.x_in < j.x_in;
}

bool comp_x_fin (s i, s j)
{
	if(i.x_fin == j.x_fin)
	{
		return i.breaker < j.breaker;
	}
	return i.x_fin < j.x_fin;
}

void readin(vector<s> &v, int n, bool again)
{
	REP(i, n)
	{	
		int x1, x2, y1, y2;
		int x, y;
		scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
		x = MIN(x1, x2);
		y = ABS(y1 - y2);
		if(again)
		{
			v[i].x_fin = x;
		}
		else
		{
			s st;
			st.y = y;
			st.x_in = x;
			st.breaker = i;
			v.PB(st);	
		}
	}
}

int main() {
	int cases;
	scanf("%d", &cases);
	REP(c, cases)
	{
		int n, w;	
		vector<s> v;
		scanf("%d %d", &n, &w);
		readin(v, n, false);
		readin(v, n, true);

		sort(v.begin(), v.end(), comp_x_fin);
		int id = 0;
		FOREACH(i, v)
		{
			i->idx_fin = id++;
		}

		sort(v.begin(), v.end(), comp_x_in);

		bool success = true;
		MaxTree tr(16);
		int max = -1;
		FOREACH(i, v)
		{
			if(i->idx_fin < max)
			{
				int max_height = tr.Find(i->idx_fin, max);
				if(max_height + i->y > w)
				{
					success = false;
					break;
				}
			}
			tr.Set(i->idx_fin, i->y);
			
			max = MAX(max, i->idx_fin);
		}

		if(success)
		{
			printf("TAK\n");
		}	
		else
		{
			printf("NIE\n");
		}
	}
	return 0;
}