#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 2e5 + 5;
const int INF = 1e9 + 7;
int n, L;
ii a[N], b[N];
vector<ii> tmp;
vector<int> lef, rig;
set<ii> s;
int len = 0;
void read() {
    cin >> n >> L;
    len = 0;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].first >> a[i].second;
        b[i] = a[i];
        if (a[i].fi != -1 && a[i].se != -1) len += a[i].se - a[i].fi + 1;
    }
}
bool check() {
    for(int i = 1; i <= n; i++) {
        if (a[i].first != -1 && a[i].second == -1) {
            a[i].second = a[i].first;
        }
        if (a[i].first == -1 && a[i].second != -1) {
            a[i].first = a[i].second;
        }
    }
    sort(a + 1, a + n + 1);
    ii pre = {0, 0};
    for(int i = 1; i <= n; i++) {
        if (a[i].fi == -1 && a[i].se == -1) continue;
        if (pre.fi == 0) pre = a[i];
        else {
            if (pre.fi <= a[i].fi && a[i].fi <= pre.se) return 0;
            pre = a[i];
        }
    }
    return 1;
}
void solve() {
    if (check() == 0) {
        cout << "NIE\n";
        return;
    }
    swap(a, b);
    s.clear();
    tmp.clear();
    int cnt = 0, mn = 0, mx = 0;
    for(int i = 1; i <= n; i++) {
        if (a[i].first == -1 && a[i].second == -1) ++cnt;
        if (a[i].first != -1 && a[i].second != -1) {
            s.insert(a[i]);
        }
        if (a[i].first == -1 && a[i].second != -1) {
            tmp.push_back({a[i].second, 1});
        }
        if (a[i].first != -1 && a[i].second == -1) {
            tmp.push_back({a[i].first, 0});
        }
    }
    sort(ALL(tmp));
    lef.clear();
    rig.clear();
    for(int i = 0; i < SZ(tmp); i++) {
        int p = tmp[i].fi;
        //cout << p << ' ' << tmp[i].se << endl;
        if (i < SZ(tmp) - 1 && tmp[i].se == 0 && tmp[i + 1].se == 1) {
            auto it = s.lower_bound({p, p});
            if ((*it).fi > tmp[i + 1].fi) {
                s.insert({p, tmp[i + 1].fi});
                mx += (tmp[i + 1].fi - p - 1);
                ++i;
            }
            else {
                lef.push_back(tmp[i].fi);
            }
        }
        else {
            if (tmp[i].se == 0) lef.push_back(tmp[i].fi);
            else rig.push_back(tmp[i].fi);
        }
    }
    sort(ALL(lef), greater<int>());
    for(int p: lef) {
        auto it = s.lower_bound({p, p});
        //cerr << p << endl;
        if (it == s.end()) {
            s.insert({p, L});
            mx += (L - p);
        }
        else {
            s.insert({p, (*it).fi - 1});
            mx += (*it).fi - 1 - p;
        }
    }
    sort(ALL(rig));
    for(int p: rig) {
        auto it = s.upper_bound({p, p});
        if (it == s.begin()) {
            s.insert({1, p});
            mx += p - 1;
        }
        else {
            --it;
            s.insert({(*it).se + 1, p});
            mx += p - (*it).se - 1;
        }
    }
    int pre = 0;
    for(auto it: s) {
        assert(it.se >= it.fi);
        //cerr << it.fi << ' ' << it.se << endl;
        if (it.fi != pre + 1) ++mn;
        pre = it.se;
    }
    if (pre != L) ++mn;
    if (mn > cnt || cnt > L - len) {
        cout << "NIE\n";
        return;
    }
    if (mn <= cnt && cnt <= mx) cout << "TAK\n";
    else cout << "NIE\n";
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen("long.inp", "r")) {
        freopen("long.inp", "r", stdin);
        freopen("long.out", "w", stdout);
    }
    int test = 1;
    cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}