#include<bits/stdc++.h>
int T,n,m,l[200005],r[200005],g,len;
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin>>T;
    while(T--)
    {
        std::set<std::pair<int,int>> set;
        bool ans=true;
        g=0;
        len=0;
        std::cin>>n>>m;
        for(int i=1;i<=n;++i)
        {
            std::cin>>l[i]>>r[i];
            if(l[i]==-1&&r[i]==-1)
            {
                ++g;
                len+=1;
            }
            else if(r[i]==-1)
            {
                set.insert({l[i],0});
                len+=1;
            }
            else if(l[i]==-1)
            {
                set.insert({r[i],1});
                len+=1;
            }
            else
            {
                set.insert({l[i],0});
                set.insert({r[i],1});
                len+=r[i]-l[i]+1;
            }
        }
        set.insert({m+1,0});
        for(int i=1;i<=n;++i)
        {
            if(~l[i]&&~r[i])
            {
                std::set<std::pair<int,int>>::iterator iter=set.upper_bound({l[i],10});
                if(iter->first<r[i])
                    ans=false;
            }
        }
        int cur=0,p=1;
        for(auto i:set)
        {
            if(cur==i.first)
                ans=false;
            if(i.second)
            {
                p=1;
                cur=i.first;
            }
            else
            {
                if(p==1&&cur!=i.first-1)
                    --g;
                p=0;
                cur=i.first;
            }
        }
        ans&=g>=0&&len<=m;
        std::cout<<(ans?"TAK":"NIE")<<std::endl;
    }
    return 0;
}