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
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>		//UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>		//do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;

#define MR 66000

struct
{
	int p, k;	//poczatek, koniec
	int v;		//max wartosc na przedziale
}tree[2*MR];

void build(int nr, int p, int k)
{
	tree[nr].p = p;
	tree[nr].k = k;	
	tree[nr].v = 0;
	if(p < k)
	{
		build(2*nr, p, (p+k)/2);
		build(2*nr+1, (p+k)/2+1, k);
	}
}//build

int p,k,ile;
//zwroc wartosc dajaca max na przedziale p..k
int ans(int nr)
{
	if(tree[nr].p > k || tree[nr].k < p)
		return 0;
	if(tree[nr].p < p || tree[nr].k > k)
		return max(ans(2*nr), ans(2*nr+1));
	return tree[nr].v;
}//ans

void change(int nr)	//zmieniamy max w lisciu na ile
{
	tree[nr].v = ile;
	nr >>= 1;
	while(nr)
	{
		tree[nr].v = max(tree[2*nr].v,tree[2*nr+1].v);	//uaktualnij max na przedziale
		nr >>= 1;
	}
}//change

int pos[MR];

int main()
{
	int t;
	scanf("%d", &t);
	REP(c,t)
	{
		int n, w;
		scanf("%d%d", &n, &w);
		int size = 1;
		while(size < n) size <<= 1;
		build(1,1,size);
		vector < pair < pair < int, int >, int > > v1;
		REP(i,n)
		{
			int x1, y1, x2, y2;
			scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
			v1.PB(MP(MP(min(x1,x2),abs(y1-y2)),i));
		}
		sort(v1.begin(), v1.end());
		//wyznacz pozycje i wstaw maxy
		REP(i,n)
		{
			pos[v1[i].ND] = i+1;
			ile = v1[i].ST.ND;
			change(size+i);
		}

		vector < pair < pair < int, int >, int > > v2;
		REP(i,n)
		{
			int x1, y1, x2, y2;
			scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
			v2.PB(MP(MP(min(x1,x2),abs(y1-y2)),i));
		}
		sort(v2.begin(), v2.end());
		bool res = 1;
		p = 1;
		REP(i,n)
		{
			k = pos[v2[i].ND]-1;	//pozycja w pierwszym ciagu-1
			if(k >= p && ans(1) > w-v2[i].ST.ND)
			{
				res = 0;
				break;
			}
			//usun maxa
			ile = 0;
			change(size+k);
		}
		if(res) printf("TAK\n");
		else printf("NIE\n");
	}
	return 0;
}