#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 2e5;

int N, L;
pii A[MAXN+10];

int main2()
{
    cin >> N >> L;
    for(int i=1; i<=N; i++) cin >> A[i].first >> A[i].second;
    if(N>L) return !(cout << "NIE\n");
    vector<int> V, in, out, chk;
    for(int i=1; i<=N; i++)
    {
        if(A[i].first!=-1) A[i].first--;
        if(A[i].first!=-1) V.push_back(A[i].first);
        if(A[i].second!=-1) V.push_back(A[i].second);
    }
    V.push_back(0); V.push_back(L);
    sort(V.begin(), V.end());
    V.erase(unique(V.begin(), V.end()), V.end());
    chk=in=out=vector<int>(V.size());

    for(int i=1; i<=N; i++)
    {
        auto [a, b] = A[i];
        if(a!=-1) a=lower_bound(V.begin(), V.end(), a)-V.begin();
        if(b!=-1) b=lower_bound(V.begin(), V.end(), b)-V.begin();
        if(a!=-1 && b!=-1 && a+1!=b) return !(cout << "NIE\n");
        if(a!=-1 && b!=-1) chk[a]=1;
        if(a!=-1) out[a]++;
        if(b!=-1) in[b]++;
    }

    for(int i=0; i<V.size(); i++)
    {
        if(in[i]>1 || out[i]>1) return !(cout << "NIE\n");
    }

    ll l=0, r=0;
    for(int i=0; i+1<V.size(); i++)
    {
        if(chk[i]) continue;
        if(out[i] && in[i+1]) l++, r+=V[i+1]-V[i]-1;
        else r+=V[i+1]-V[i]-1;
    }

    // cout << l << " " << r << "\n";

    if(l<=N+1-V.size() && N+1-V.size()<=r) cout << "TAK\n";
    else cout << "NIE\n";
    return 0;
}

void reset()
{

}

int main() {
    cin.tie(0); ios_base::sync_with_stdio(0);

    int TC;
    cin >> TC;
    while(TC--)
    {
        main2();
        reset();
    }
}