#include<iostream>
#include<algorithm>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
pair<int,int>x[10000050];
bool cmp(pair<int,int>a,pair<int,int>b){
    if(a.first*b.first)return a.first<b.first;
    if(a.second*b.second)return a.first<b.first;
    if(a.first+a.second==0)return false;
    if(b.first+b.second==0)return true;
    if(a.first==0)return a.second<b.first;
    else return b.second>a.first;
}
int main(){
    int t;cin>>t;while(t--){
        bool flag=1;
        int L,n;cin>>n>>L;
        int cnt=0,rdd=0;
        for(int i=1;i<=n;i++){
            cin>>x[i].first>>x[i].second;
            if(x[i].first==-1)x[i].first=0;
            if(x[i].second==-1)x[i].second=0;
            if(x[i].first+x[i].second==0)cnt++;
            if(x[i].first*x[i].second){
                if(x[i].second<x[i].first)flag=0;
                rdd+=x[i].second-x[i].first;
            }
        }
        if(L-rdd<n){
            cout<<"NIE"<<endl;
            continue;
        }
        sort(x+1,x+n+1,cmp);
        n-=cnt;
        int lst=0,op=0;
        for(int i=1;i<=n;i++){
            if(!x[i].first){
                if(x[i].second<=lst)flag=0;
            }
            else{
                if(x[i].first<=lst)flag=0;
                if(x[i].first>lst+1){
                    if(!op)cnt--;
                }
            }
            if(x[i].second){
                op=0;
                lst=x[i].second;
            }else{
                op=1;
                lst=x[i].first;
            }
        }
        if(lst!=L&&op!=1)cnt--;
        if(cnt<0)flag=false;
        if(flag)cout<<"TAK\n";
        else cout<<"NIE\n";
    }

}