#include <bits/stdc++.h>
using namespace std;
#define SZ 200055
int T,n,l;
typedef pair<int,int> pii;
#define fi first
#define se second
pii s[SZ];
bool sol() {
    scanf("%d%d",&n,&l); int N=n,lex=0;
    for(int i=1;i<=n;++i) {
        scanf("%d%d",&s[i].fi,&s[i].se);
        if(s[i].fi==-1&&s[i].se==-1) {
            ++lex; --i, --n;
        }
    }
    s[++n]=pii(l+1,l+1);
    sort(s+1,s+1+n,[&](pii a,pii b) {
        return max(a.fi,a.se)<max(b.fi,b.se);
    });
    int lexl=0,lexr=0,R=0,ext=0;
    for(int i=1;i<=n;++i) {
        int x=s[i].fi,y=s[i].se;
        if(x==-1) {
            assert(y!=-1);
            if(R>=y) return 0;
            lexr+=y-R-1;
            R=y, ext=0;
        }
        else {
            if(R!=x-1) {
                if(!ext) lexl++;
                lexr+=x-1-R;
            }
            if(y==-1) {
                R=x; ext=1;
            }
            else R=y, ext=0;
        }
    // cerr<<lexl<<" "<<lexr<<"|"<<R<<","<<ext<<" "<<lex<<"\n";
    }
    return lexl<=lex&&lex<=lexr;
}
int main() {
    scanf("%d",&T);
    while(T--) puts(sol()?"TAK":"NIE");
}