#include<bits/stdc++.h>
using namespace std;
const int N=2e5;
int n,L;
int l[N+5],r[N+5];
int pos[N*2+5],tot;
void solve(){
    scanf("%d %d",&n,&L);
    int cnt=0;
    tot=0;
    unordered_map<int,int> fl,fr;
    for(int i=1;i<=n;i++){
        scanf("%d %d",&l[i],&r[i]);
        if(l[i]==-1&&r[i]==-1){
            cnt++;
        }
        else{
            if(l[i]!=-1){
                pos[++tot]=l[i];
                fl[l[i]]=i;
            }
            if(r[i]!=-1){
                if(l[i]!=r[i])
                    pos[++tot]=r[i];
                fr[r[i]]=i;
            }
        }
    }
    pos[++tot]=L+1;
    sort(pos,pos+1+tot);
    for(int i=1;i<tot;i++)
        if(pos[i]==pos[i+1]){
            puts("NIE");
            return;
        }
    fr[0]=0; fl[L+1]=n+1;
    for(int i=1;i<tot;i++){
        if(fr[pos[i]]){
            int x=fr[pos[i]];
            if(l[x]!=-1){
                if(l[x]!=pos[i]&&l[x]!=pos[i-1]){
                    puts("NIE");
                    return;
                }
            }
        }
    }
    int cl=0,cr=0;
    for(int i=1;i<=tot;i++){
        int pl=pos[i-1],pr=pos[i];
        if(fl[pl]&&fl[pl]==fr[pr]) continue;
        if(fr[pl]&&fl[pr]){
            cl+=min(1,pr-pl-1);
        }
        cr+=pr-pl-1;
    }
    puts(cl<=cnt&&cr>=cnt?"TAK":"NIE");
}
int main(){
    int t; scanf("%d",&t);
    while(t--) solve();
    return 0;
}