#include <bits/stdc++.h>

#define speed                                                                  \
  ios_base::sync_with_stdio(0);                                                \
  cin.tie(0);                                                                  \
  cout.tie(0)
#define ll long long
#define YES "TAK"
#define NO "NIE"
#define endline '\n'

using namespace std;

const ll N = 5e5 + 10, MM = 998244353, MAX = 1e18;

int solve() {
  int n;
  cin >> n;
  ll l;
  cin >> l;
  map<ll, ll> mp;
  mp[l+1]=1;
  map<ll, ll> mp1, mp2;
  ll sum = 0, sum1 = 0;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    if (a + 1) {
      mp[a]++;
      mp1[a] = b;
    }
    if (b + 1 && a != b) {
      mp[b]++;
      mp2[b] = a;
    }
    if (a == -1 && b == -1) {
      sum++;
      sum1++;
    } else if (a + 1 && b + 1) {
      sum += b - a + 1;
    }
  }
  for (auto x : mp)
    if (x.second > 1)
      return cout << NO << endline, 0;
  if (sum > l)
    return cout << NO << endline, 0;

  int cur = 1;
  ll need = 0, can = 0;
  while (mp.size()>1) {
    int mn = mp.begin()->first;
    mp.erase(mp.begin());
    if (mp1.count(mn)) {
      if(cur>mn)return cout<<NO<<endline,0;
      if (cur != mn){
        need++, can += mn - cur;
      }
      int nxt = mp1[mn];
      if (nxt != -1) {
        mp.erase(nxt);
        cur = nxt + 1;
      } else {
        cur = mp.begin()->first;
      }
    } else {
      can += mn - cur;
      cur = mn + 1;
    }
  }
  if(cur!=l+1)need++;
  if (need <= sum1)
    cout << YES << endline;
  else
    cout << NO << endline;
  return 0;
}

int main() {
  speed;
  int t = 1;
  cin >> t;
  int i = 1;
  while (t--) {
    // cout << "Case #" << i++ << ": ";
    solve();
  }
  return 0;
}
/*


*/