#include<bits/stdc++.h>
using namespace std;

int n,m,cnt;
pair<int,int> a[200003];

bool solve(){
    scanf("%d%d",&n,&m),cnt=0;
    int unknown=0,mayunknown=0;
    for(int i=1;i<=n;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        if(x==-1&&y==-1)unknown++;
        else a[++cnt]={x,y};
    }
    a[++cnt]={0,0},a[++cnt]={m+1,m+1};
    sort(a+1,a+1+cnt,[&](pair<int,int> x,pair<int,int> y){
        int vx=x.first==-1?x.second:x.first;
        int vy=y.first==-1?y.second:y.first;
        return vx<vy;
    });
    for(int i=1;i<cnt;i++){
        if(a[i].second!=-1&&a[i+1].first!=-1){
            if(a[i].second>=a[i+1].first)return false;
            if(a[i].second+1==a[i+1].first)continue;
            unknown--;
            mayunknown+=a[i+1].first-a[i].second-2;
            continue;
        }
        if(a[i].second!=-1){
            mayunknown+=a[i+1].second-a[i].second-1;
            continue;
        }
        if(a[i+1].first!=-1){
            mayunknown+=a[i+1].first-a[i].first-1;
            continue;
        }
        mayunknown+=a[i+1].second-a[i].first-1;
    }
    return mayunknown>=unknown&&unknown>=0;
}

int main(){
    int T; scanf("%d",&T);
    while(T--){
        if(solve())puts("TAK");
        else puts("NIE");
    }
    return 0;
}