#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define fi first
#define se second
#define pb push_back

using namespace std;
using ll = long long;
using pii = pair<int,int>;

const int N = 2e5 + 10;
int eval(pii pr) {
    if(pr.fi == -1) return pr.se;
    return pr.fi;
}

signed main() {
    int T;
    cin >> T;
    while(T --) {
        int n, L;
        cin >> n >> L;
        int cnt = 0;
        ll len = 0;
        bool flg = true;
        vector<pii> vec;
        set<int> s;
        rep(i,1,n) {
            int l, r; cin >> l >> r;
            if(l == -1 && r == -1) ++ cnt;
            else {
                if(~l && ~r) {
                    if(l > r) flg = false;
                    len += r - l + 1;
                }
                vec.pb({l, r});
            }
            if(~l) { int sz = s.size(); s.insert(l); if(sz == s.size()) flg = false; }
            if(~r) { int sz = s.size(); s.insert(r); if(sz == s.size()) flg = false; }
        }
        s.clear();
        // cout << flg << ' ' << len << ' ' << cnt << endl;
        if(len + cnt > L || !flg) {
            cout << "NIE" << endl;
            continue;
        }
        sort(vec.begin(), vec.end(), [&](pii x, pii y) {
            return eval(x) < eval(y);
        });

        // for(pii x : vec) cout << x.fi << ',' << x.se << endl;

        int cnt2 = 0;
        if(vec[0].fi != -1 && vec[0].fi != 1) ++ cnt2;
        int sz = vec.size() - 1;
        if(vec[sz].se != L && vec[sz].se != -1) ++ cnt2;
        rep(i,0,sz-1) if(vec[i].se != -1 && vec[i + 1].fi != -1 && vec[i].se + 1 != vec[i + 1].fi) ++ cnt2;
        if(cnt2 > cnt) flg = false;

        int r = 0;

        for(pii x : vec) {
            if(eval(x) <= r) {
                flg = false;
                break;
            }
        }

        cout << (flg ? "TAK" : "NIE") << endl;

    }
    return 0;
}