#include <bits/stdc++.h>
typedef long long ll;

using namespace std;
typedef pair<int,int> PII;
const int N=1e7+10;
int mp[100][100];
    int n;
vector<bool> stx(100),sty(100);
struct node{
    int l, r;
    int type;
    bool operator <(const node& x) const{
        if(this->l!=x.l) return this->l<x.l;
        return this->r<x.r;
    }
};
void solve(){ 
 
    cin>>n;
    int l;
    cin>>l;
    vector<node> vc;
    int cnt=0;
    int x=0;
    int temp=0;
    for(int i=1;i<=n;i++){
        int l,r;
        cin>>l>>r;
        if(l==-1&&r==-1){
            cnt++;
        }else{
            if(l==-1){
                vc.push_back({r,r,1});x++;
            }else if(r==-1){
                vc.push_back({l,l,-1});x++;
            }else{
                vc.push_back({l,r,0});x+=r-l+1;
            }
        }
    }
    sort(vc.begin(),vc.end());
    for(int i=1;i<vc.size();i++){
        if(vc[i].l<=vc[i-1].r){
            cout<<"NIE"<<endl;
            return;
        }
    }
    for(int i=1;i<vc.size();i++){
        if((vc[i].type==0&&vc[i-1].type==0)||(vc[i-1].type==1&&vc[i].type==-1)){
            if(vc[i-1].r+1!=vc[i].l){
                cout<<"NIE"<<endl;
                return;
            }
        }else{
            temp+=vc[i].l-vc[i-1].r-1;
        }
    }
    if(l-x>=cnt&&cnt+x+temp>=l){
        cout<<"TAK"<<endl;
    }else cout<<"NIE"<<endl;
}   

int main(){

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




}