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
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <stack>
#include <cstring>
#include <iomanip>
#include <ctime>
using namespace std;
#define pb push_back
#define INF 1001001001
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
#define FORI(i,n) for(int (i)=1;(i)<=(n);++(i))
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define vi vector<int>
#define SZ(x) ((int)((x).size()))
#define fi first
#define se second
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));
#define wez3(n,m,k) int (n),(m),(k); scanf("%d %d %d",&(n),&(m),&(k));
inline void pisz(int n) { printf("%d\n",n); }
template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream& operator<<(ostream &s,vector<T> t){FOR(i,SZ(t))s<<t[i]<<" ";return s; }
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define TESTS wez(testow)while(testow--)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define IOS ios_base::sync_with_stdio(0);

#define rec pair<pair<int,int>, pair<int,int> >

vector<rec> pocz,kon;
int whereto[50042];
int M=1;
int w[1000042]; //rozmiar ?????

void insert(int pos, int val)
{
    int v=pos+M;
    w[v]=val;
    while(v!=1)
    {
           v/=2;
           w[v]=max(w[2*v],w[2*v+1]);                 
    } 
}

int query(int a,int b)
{
    if(b < a)return 0;
    int res=0;
    int va=a+M,vb=b+M;
    //vector<long long int> duze,male;
    res=w[va];
    if(va!=vb)res=max(res,w[vb]);
    while(va/2!=vb/2)
    {
          if(va%2==0)res=max(w[va+1],res);
          if(vb%2==1)res=max(w[vb-1],res);
          va/=2;
          vb/=2;                            
    }      
    return res;
}

void solve()
{
	wez2(n,w);
	pocz.clear(); kon.clear();
	for(int i=0;i<n;i++)
	{
		int x1,y1,x2,y2;
		scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		pocz.pb(mp(mp(min(x1,x2),min(y1,y1)),mp(max(y1,y2)-min(y1,y2),i)));
	}
	for(int i=0;i<n;i++)
	{
		int x1,y1,x2,y2;
		scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		kon.pb(mp(mp(min(x1,x2),min(y1,y1)),mp(max(y1,y2)-min(y1,y2),i)));
	}
	//printf("po wczytaniu\n");
	sort(pocz.begin(),pocz.end());
	sort(kon.begin(),kon.end());
	//printf("po sortowaniu\n");
	for(int i=0;i<n;i++)whereto[kon[i].second.second]=i;
	//printf("po 'whereto'\n");
	//printf("whereto\n");
	//for(int i=0;i<n;i++)printf("%d ",whereto[i]);
	//printf("\n");
	
	M=1;
	while(M<n)M*=2;
	for(int i=0;i<n;i++)insert(i,0);
	for(int i=0;i<n;i++)insert(i,kon[i].second.first);
	
	bool ok=true;
	for(int i=0;i<n;i++)
	{
		int temp = query(0,whereto[pocz[i].second.second]-1);
		if(temp + pocz[i].second.first > w)
		{
			ok = false;
			break;
		}
		insert(whereto[pocz[i].second.second],0);
	}
	if(ok)printf("TAK\n");
	else printf("NIE\n");
}

int main()
{
	wez(t);
	for(int i=0;i<t;i++)solve();    
    	return 0;   
}