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 <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cstdio>
#include <utility>
#include <iomanip>
#include <assert.h>
#define MP make_pair
#define PB push_back
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define PB push_back
#define MP make_pair
#ifdef LOCAL
#define debug(x) {cerr <<#x <<" = " <<x <<"\n"; }
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<"\n"; }}
#else
#define debug(x)
#define debugv(x)
#endif
#define make(type, x) type x; cin>>x;
#define make2(type, x, y) type x, y; cin>>x>>y;
#define make3(type, x, y, z) type x, y, z; cin>>x>>y>>z;
using namespace std;
typedef long long ll;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef vector<int> VI;
typedef vector<ll> VLL;
typedef vector<pair<int, int> > VPII;
typedef vector<pair<ll, ll> > VPLL;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}

const int N = 5e4 + 5;
const int M = 1 << 16;
struct Car {
  int x1, x2, hei;
  Car(int x1_, int x2_, int hei_) : x1(x1_), x2(x2_), hei(hei_) {}
};
bool by_x2(const Car& a, const Car& b) {
  return a.x2 < b.x2;
}
bool by_x1(const Car& a, const Car& b) {
  return a.x1 < b.x1;
}
void Add(vector<int>& drz, int a, int val) {
  a += M - 1;
  while (a) {
    maxi(drz[a], val);
    a /= 2;
  }
}
int Read(vector<int>& drz, int a, int b) {
  a += M - 1;
  b += M - 1;
  int res = drz[a];
  maxi(res, drz[b]);
  while (a / 2 != b / 2) {
    if (a % 2 == 0) {
      maxi(res, drz[a + 1]);
    }
    if (b % 2 == 1) {
      maxi(res, drz[b - 1]);
    }
    a /= 2;
    b /= 2;
  }
  return res;
}
int main() {
  // nie zapomnij o ll
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  
  make(int, t);
  while (t--) {
    make2(int, n, w);
    vector<int> drz;
    drz.resize(2 * M + 5);
    vector<Car> cars;
    RE (i, n) {
      make2(int, x1, y1);
      make2(int, x2, y2);
      cars.PB(Car(min(x1, x2), 0, abs(y2-y1)));
    }
    RE (i, n) {
      make2(int, x1, y1);
      make2(int, x2, y2);
      cars[i - 1].x2 = min(x1, x2);
    }
    sort(ALL(cars), by_x2);
    for (int i = 0; i < n; i++) {
      cars[i].x2 = i + 1;
    }
    sort(ALL(cars), by_x1);
    for (int i = 0; i < n; i++) {
      //cerr<<"Max na prawo od "<<cars[i].x2<<" to "<<Read(drz, cars[i].x2, n)<<endl;
      if (cars[i].hei + Read(drz, cars[i].x2, n) > w) {
        cout<<"NIE"<<endl;
        goto A;
      }
      //cerr<<"Dodaje "<<cars[i].hei<<" na x="<<cars[i].x2<<endl;
      Add(drz, cars[i].x2, cars[i].hei);
    }
    cout<<"TAK"<<endl;
    A: ;
  }
    
    
    

  // nie zapomnij o ll
  return 0;
}