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
#include <iostream>
#include <algorithm>

using namespace std;

int t;
int w;
int n;


int a,b;

int ul;

bool dasie;

bool dod(int tab[],int x){
	if(tab[x] - tab[x + 1] > 0)return true;
	else if(tab[x] - tab[x + 1] < 0)return false;
}

int main(){
	ios_base::sync_with_stdio(0);

	cin >> t;

	for (int j = 0; j < t; ++j)
	{	
		dasie = true;
		cin >> n >> w;

		int be[n];
		int af[n];
		int wi[n];

		for (int i = 0; i < n; ++i)
		{
			cin >> be[i] >> a >> ul	>> b;
				
			wi[i] = abs(a - b);
		}

		for (int i = 0; i < n; ++i)
		{
			cin >> af[i] >> ul >> ul >> ul;
		}


		for (int i = 0; i < n - 1; ++i)
		{
			if(dod(be,i) != dod(af,i)){
				if(wi[i] + wi[i+1] > w)dasie = false;
			}
		}

		if(dasie)cout << "TAK";
		else cout << "NIE";

		cout << "\n";
	}
	return 0;
}