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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; 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
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

typedef pair<pii, int> Elem;

const int N = 50100;
const int K = (1 << 16); // 65k
Elem input[N];
Elem output[N];
int posIn[N];
int maxTree[2 * K];
int n, w;

int P;

int getMax(int p, int q, int pocz = 1, int kon = P, int ind = 1) {
	//printf("getMax(%d, %d, %d, %d, %d)\n", p, q, pocz, kon, ind);
	int sr = (pocz + kon) / 2;
	if (p > q) return 0;
	if (p == pocz && q == kon) return maxTree[ind];
	else if (q <= sr) return getMax(p, q, pocz, sr, 2*ind);
	else if (p > sr) return getMax(p, q, sr+1, kon, 2* ind + 1);
	else return max(getMax(p,sr,pocz,sr,2*ind), getMax(sr+1, q, sr+1, kon, 2*ind+1));
}

void remove(int pos) {
	pos = pos + P - 1;
	maxTree[pos] = 0;
	while (pos>>1) {
		pos >>= 1;
		maxTree[pos] = max(maxTree[2 * pos], maxTree[2 * pos + 1]);
	}
}

void testCase() {
	scanf("%d %d", &n, &w);
	REP(i, n) {
		int x1, x2, y1, y2;
		scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
		int wys = abs(y1 - y2);
		input[i].ST = mp(min(x1, x2), wys);
		input[i].ND = i;
	}
	REP(i, n) {
		int x1, x2, y1, y2;
		scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
		int wys = abs(y1 - y2);
		output[i].ST = mp(min(x1, x2), wys);
		output[i].ND = i;
	}
	sort(input, input + n);
	REP(i, n) {
		posIn[input[i].ND] = i;
	}
	sort(output, output + n);
	P = 1;
	while (P < n) P <<= 1;
	REP(i, n) maxTree[P + i] = input[i].ST.ND;
	REP(i, P - n) maxTree[P + n + i] = 0;
	FORD(i, P, 1) {
		maxTree[i] = max(maxTree[2*i], maxTree[2*i + 1]);
	}

	bool ok = true;
	REP(i, n) {
		// elem: output[i].ND
		int pos = posIn[output[i].ND] + 1;
		int MaxPrzed = getMax(1, pos - 1);
		if (MaxPrzed + output[i].ST.ND > w) {
			ok = false;
			break;
		}
		remove(pos);
	}
	printf("%s\n", ok ? "TAK" : "NIE");
}

int main() {
	int t;
	scanf("%d", &t);
	while (t--) {
		testCase();
	}
	return 0;
}