#include<bits/stdc++.h>
using namespace std;
int n,L;
void solve(){
   scanf("%d%d",&n,&L);
   vector<pair<int,int>>a(n);
   for(auto&X:a)scanf("%d%d",&X.first,&X.second);
   auto it=remove(begin(a),end(a),pair<int,int>{-1,-1});
   int c0=end(a)-it;a.erase(it,end(a));
   sort(begin(a),end(a),[](auto X,auto Y){
      return(X.first==-1?X.second:X.first)<(Y.first==-1?Y.second:Y.first);
   });
   struct N_{int l,r,i;};
   vector<N_>b;
   auto gv=[](int x,int y){return x==-1?y:x;};
   if(a.empty())return puts(c0<=L?"TAK":"NIE"),void();
   for(int i=1;i<a.size();i++){
      auto x=gv(a[i-1].second,a[i-1].first),y=gv(a[i].first,a[i].second);
      if(x>=y)return puts("NIE"),void();
      if(x+1<y){
         if(a[i-1].second!=-1&&a[i].first!=-1&&!c0--)return puts("NIE"),void();
         if(a[i-1].second==-1&&a[i].first==-1)a[i].first=y;
         b.push_back({x+1,y-1,i});
      }else{
         a[i-1].second=x,a[i].first=y;
      }
   }
   if(gv(a[0].first,a[0].second)>1){
      if(a[0].first!=-1&&!c0--)return puts("NIE"),void();
      b.push_back({1,a[0].first-1,0});
   }else a[0].first=1;
   if(gv(a.back().second,a.back().first)<L){
      if(a.back().second!=-1&&!c0--)return puts("NIE"),void();
      b.push_back({a.back().second+1,L,n});
   }else a[n-1].second=L;
   for(auto x:b)c0-=x.r-x.l+1;
   puts(c0<=0?"TAK":"NIE");
}
int main(){
   int T;for(scanf("%d",&T);T--;)solve();
   return 0;
}