#include <bits/stdc++.h>
void Yes() { std::cout << "YES" << "\n"; return; }
void No() { std::cout << "NO" << "\n"; return; }
template <typename T>
void out(T x) { std::cout << x << "\n"; }
using namespace std;
using ll=long long;
using PII=pair<ll,ll>;

vector<ll>alls;
ll find(ll x) {//需要查询的值x
    ll l = 0, r = alls.size()-1;
    while (l < r) {
        ll mid = (l + r) >> 1;
        if (alls[mid] >= x)r = mid;
        else l = mid + 1;
    }
    return r + 1;//返回什么具体情况而定，如果你要求前缀和的话，那么你就要加1，因为前缀和处理的时候我们都是从下标1开始的
}
const ll N = 2e5 + 10;
struct node{
    ll l,r;
}no[N];
void Solve()
{
    priority_queue<PII,vector<PII>,greater<PII>>q;
    alls.clear();
    ll n,L;
    cin >> n >> L;

    ll Dis = L;

    ll num = 0;
    for(ll i = 1;i <= n;i ++ )
    {
        ll l,r;
        cin >> l >> r ;
        if(l == -1 && r == -1) num++;
        if(l != -1 && r != -1) {
            Dis -= (r-l+1);
        }
        if(l == -1) l = 2e9,Dis --;
        if(r == -1) r = 2e9 , Dis--;
        no[i] = {l,r};
    }
    no[n+1] = {L+1,L+1};
    sort(no+1,no+1+n,[&](node a,node b) {
       return min(a.l,a.r) < min(b.l,b.r);
    });
    ll now = 1;
    for(ll i = 1;i<=n;i++) {
        if(no[i].l != now && no[i].l != 2e9) {
            num--;
        }
        if(no[i].r != 2e9) {
            now = no[i].r + 1;
        }
        else {
            now = min(no[i+1].l,no[i+1].r);
        }
    }

    if(Dis <  num || num < 0 || now != L + 1) {
        out("NIE");
        return;
    }
    else {
        out("TAK");
        return;
    }
}

signed main()
{
    std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll t=1;
    cin>>t;
    while(t--)
    Solve();
}