#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(0) cerr
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;

int getknown(array<int, 2>& v) {
  if(v[0] >= 0) return v[0];
  return v[1];
}
void rsolve() {
  int n, maxv;
  cin >> n >> maxv;
  int unknown = 0;
  vector<array<int, 2>> v;
  while(n--) {
    int a, b;
    cin >> a >> b;
    if(a == -1 && b == -1) unknown++;
    else v.pb({a, b});
  }
  sort(all(v), [&](array<int, 2> a, array<int, 2> b) {
    return getknown(a) < getknown(b);
  });
  // check consistency
  vector<int> observe;
  for(auto [a, b]: v) {
    if(a != -1) observe.pb(a);
    if(b != -1 && a != b) observe.pb(b);
  }
  for(int i = 1; i < sz(observe); i ++) {
    if(observe[i] <= observe[i-1]) {
      cout << "NIE\n";
      return;
    }
  }
  int lhs = 0;
  int rhs = 0;
  if(sz(v) == 0) {
    lhs = 1;
    rhs = maxv;
  }
  else {
    // check left of zero
    if(v[0][0] >= 0) {
      if(v[0][0] > 1) lhs++;
      rhs += v[0][0] - 1;
    }
    else {
      assert(v[0][0] == -1);
      rhs += v[0][1] - 1;
    }
    for(int i = 0; i + 1 < sz(v); i++) {
      if(v[i][1] >= 0 && v[i+1][0] >= 0) {
        // both sides known
        // exact match
        if(v[i][1] + 1 == v[i+1][0]) continue;
        int gap = v[i+1][0] - v[i][1];
        lhs++;
        rhs += gap;
        continue;
      }
      if(v[i][1] >= 0) {
        // left side RHS known
        // [a, b][?, c]
        assert(v[i+1][0] == -1);
        rhs += v[i+1][1] - v[i][1] - 1;
        continue;
      }
      assert(v[i][1] == -1);
      if(v[i+1][0] >= 0) {
        // right side LHS known
        rhs += v[i+1][0] - v[i][0] - 1;
        continue;
      }
      assert(v[i][1] == -1 && v[i+1][0] == -1);
      rhs += v[i+1][1] - v[i][0] - 1;
    }
    // check right of last one
    if(v.back()[1] >= 0) {
      if(v.back()[1] < maxv) lhs++;
      rhs += maxv - v.back()[1];
    } 
    else {
      assert(v.back()[1] == -1);
      rhs += maxv - v.back()[0];
    }
  }
  if(lhs <= unknown && unknown <= rhs) {
    cout << "TAK\n";
    return;
  }
  cout << "NIE\n";
}
void solve() {
  int t;
  cin >> t;
  while(t--) rsolve();
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}