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

void solve(){
    int n,maxn;
    cin>>n>>maxn;

    vector<pair<int,int>> no;
    vector<int> L,R; 
    set<int> a;

    int cnt=0,k=n;

    for(int i=1;i<=n;i++){
        int l,r;
        cin>>l>>r;
        if(l!=-1&&r!=-1){
            no.push_back({l,r});
            k--;
        }
        else if(l!=-1){
            a.insert(l);
        }
        else if(r!=-1){
            a.insert(r);
        }else cnt++,k--;
    }

    if(a.size()!=k){
        cout<<"NIE\n";
        return;
    }

    sort(no.begin(),no.end());

    int len=no.size();
    for(int i=1;i<len;i++){
        if(no[i].first<=no[i-1].second){
            cout<<"NIE\n";
            return;
        }
    }

    int l=1,r;
    for(int i=0;i<len;i++){
        r=no[i].first-1;
        if(l<=r){
            L.push_back(l);
            R.push_back(r);
        }
        l=no[i].second+1;
    }
    r=maxn;
    if(l<=r){
        L.push_back(l);
        R.push_back(r);
    }

    int m=L.size();
    vector<int> b(m);

    for(auto x:a){
        auto it=lower_bound(L.begin(),L.end(),x);
        if(it==L.end()){
            cout<<"NIE\n";
            return;
        }
        int p=it-L.begin();
        if(x>R[p]){
            cout<<"NIE\n";
            return;
        }
        b[p]++;
    }

    int sum=0,num=0;
    for(int i=0;i<m;i++){
        sum+=R[i]-L[i]+1-b[i];
        if(!b[i]) num++;
    }

    if(num<=cnt&&cnt<=sum){
        cout<<"TAK\n";
    }else cout<<"NIE\n";
}

int main(){
    ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);

    int t=1;
    cin>>t;
    while(t--) solve();

    return 0;
}