#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

#define FOR(i,n) for(int i=0;i<n;++i)
#define FORB(i,b,n) for(int i=b;i<n;++i)
#define REV(i,n) for(int i=n;i>=0;--i)
#define FOREACH(T, it, v) for(T::iterator it = v.begin(); it !=v.end(); ++it)
#define print(STRING,INT) printf("%s= %d\n", STRING, INT)
#define scan(INT) scanf("%d", &INT)


typedef unsigned int u32;
const int INF = (0u - 11)/2;

typedef long long ll;
typedef set<int> SI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef set<long long> SL;
typedef map<int, int> MII;
typedef multimap<int, int> MMII;


int DEBUG_ = 1;



void log(char* S, long long a)
{
    if(DEBUG_)
    {
        printf("%s= %I64d\n", S, a);
    }
}


struct A
{
	int w;
	int x1;
	int x2;
	int index;
//	A(int _a, int _b, int _index) : w(_a), x(_b), index(_index) {}
	A() {}
};

struct B
{
	int a;
	int index;
	B() {};
};

bool compare(B a, B b)
{
	if(a.a != b.a) return a.a < b.a;
	return a.index < b.index;
}

bool rev_compare(B a, B b)
{
	if(a.a != b.a) return a.a > b.a;
	return a.index > b.index;
}

int solve()
{
	int n, maxW;
	scan(n);
	scan(maxW);
	int a, b, c, d;
	vector<A> F(n, A());
	vector<B> R(n, B());
	FOR(i,n)
	{
		scan(a); scan(b); scan(c); scan(d);
		F[i].index = i;
		F[i].w = abs(d-b);
		F[i].x1 = min(a,c);
	}
	FOR(i,n)
	{
		scan(a); scan(b); scan(c); scan(d);
		F[i].x2 = min(a,c);
		R[i].a = F[i].w;
		R[i].index = F[i].index;

	}
	sort(R.begin(), R.end(), rev_compare);
	//FOR(i,n)
	//{
	//	cout << R[i].a << " " << R[i].index << endl;
	//}



	MII PERM_A;
	MII PERM_B;
	PERM_A[-1] = -1; 
	PERM_A[INF] = -1;
	PERM_B[-1] = -1; 
	PERM_B[INF] = -1;

	int toCheck = R[0].index;
	PERM_A[F[toCheck].x1] = F[toCheck].index;
	PERM_B[F[toCheck].x2] = F[toCheck].index;

	int biggestAdded = 0;
	int biggestAddedIndex = toCheck;
	MII::iterator iterA;
	MII::iterator iterB;
//	cout << "boss dodany " << endl;
	FORB(i,1,n)
	{
	////	cout << "dodaje i " << i << " " << R[i].index << endl;
		toCheck = R[i].index;

		//cout <<F[toCheck].w << " " << F[biggestAddedIndex].w << endl;
		while(F[toCheck].w + F[biggestAddedIndex].w <= maxW)
		{
		//	cout << " juz mozna zaczac usuwac " << i << endl;
			if(biggestAdded == 0) return true;

			PERM_A.erase(PERM_A.find(F[biggestAddedIndex].x1));
			PERM_B.erase(PERM_B.find(F[biggestAddedIndex].x2));
			biggestAddedIndex = R[--biggestAdded].index;
		}
	//	cout << " dodaj " << F[toCheck].index << " "<< F[toCheck].x1 << endl;
		PERM_A[F[toCheck].x1] = F[toCheck].index;
		PERM_B[F[toCheck].x2] = F[toCheck].index;

		//FOREACH(MII, it, PERM_A)
		//{
		//	cout << it->first << " ";
		//}
		//cout << endl;
		//FOREACH(MII, it, PERM_A)
		//{
		//	cout << it->second << " ";
		//}
		//cout << endl;
		//FOREACH(MII, it, PERM_B)
		//{
		//	cout << it->first << " ";
		//}
		//cout << endl;
		//FOREACH(MII, it, PERM_B)
		//{
		//	cout << it->second << " ";
		//}

		//cout << endl;
		iterA = PERM_A.find(F[toCheck].x1);
		iterB = PERM_B.find(F[toCheck].x2);
	//	cout << iterA->second << endl;
		if((--iterA)->second != (--iterB)->second) return false; // lewy
	//	cout << iterA->second << endl;
		++iterA; ++iterB; // powrot
		//cout << iterA->second << endl;
		if((++iterA)->second != (++iterB)->second) return false;// prawy
	//	cout << iterA->second << endl;
		--iterA; --iterB;
		//cout << iterA->second << endl;

		if(biggestAdded == i - 1)
		{
			biggestAdded++;
			biggestAddedIndex = toCheck;
		}
		else
		{
	//		cout << "wyjazd dodani ostatnio " << endl;
				PERM_A.erase(iterA);
				PERM_B.erase(iterB);
		}

	}
	return true;
}


int main()
{	
	int T;
	scan(T);
	while(T--)
	{
	//	cout << T << endl;
		if(solve())
		{
			cout << "TAK" << endl;
		}
		else
		{
			cout << "NIE" << endl;
		}
	}

	return 0;
}