#include<bits/stdc++.h>
using namespace std;
#define ll long long
// #define mp make_pair
#define pb push_back
#define f(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
ll rd(){
    ll x=0,f=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
#define d rd()
ll n,m;
struct node{ll l,r;}a[1000010];
bool cmp(node a,node b){
    return max(a.l,a.r)<max(b.l,b.r);
}
int main(){
    ll T=d;while(T--){
        n=d,m=d;ll num=0;ll c=0;
        f(i,1,n){
            ll x=d,y=d;
            if(x+y==-2)num++;
            else a[++c]={x,y};
        }a[++c]={0,0},a[++c]={m+1,m+1};
        sort(a+1,a+c+1,cmp);ll ok=0;bool fl=1;
        ll l,r,L,R;
        f(i,2,c){
            l=a[i-1].l,r=a[i-1].r,L=a[i].l,R=a[i].r;
            // cout<<l<<" "<<r<<" "<<L<<" "<<R<<endl;
            if(r!=-1&&L!=-1){
                if(r>=L){fl=0;break;}
                if(L>r+1){
                    if(!num){fl=0;
                    if(n>100){
                        cout<<a[i-2].l<<" "<<a[i-2].r<<" "<<l<<" "<<r<<" "<<L<<" "<<R<<endl;
                    }
                    break;}
                    num--;ok+=L-r-1-1;
                }continue;
            }if(r!=-1&&R!=-1){
                if(r==R){fl=0;break;}
                ok+=R-r-1;continue;
            }if(l!=-1&&L!=-1){
                if(l==L){fl=0;break;}
                ok+=L-l-1;continue;
            }if(l!=-1&&R!=-1){
                if(l==R){fl=0;break;}
                ok+=R-l-1;continue;
            }
        }
        // cout<<ok<<" "<<num<<endl;
        if(ok<num)fl=0;
        if(!fl){
            puts("NIE");
            if(n>100)cout<<l<<" "<<r<<" "<<L<<" "<<R<<" "<<num<<endl;
        }
        else puts("TAK");
    }
    return 0;
}
/*
5 10
-1 -1
-1 -1
3 3
-1 4
5 10
*/