#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
const int inf = 1e9;

typedef long long i64;

struct seg {
    int l, r;
    bool gl, gr;

    bool operator<(const seg &o) const {
        return l < o.l;
    }
};

void solve() {
    int n, l;
    cin >> n >> l;
    vector<seg> segs;
    int u = 0;
    for (int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        bool gl = false, gr = false;
        if (a == -1 && b == -1) {
            u++;
            continue;
        } else if (a == -1) {
            a = b - 1;
            gl = true;
        } else if (b == -1) {
            b = a + 1;
            gr = true;
        }
        segs.push_back({.l = a, .r = b, .gl = gl, .gr = gr});
    }
    segs.push_back({-inf, 0, false, false});
    segs.push_back({l + 1, inf, false, false});
    sort(segs.begin(), segs.end());
    for (int i = 0; i < (int) segs.size(); i++) {
        cerr << segs[i].l << " " << segs[i].r << " " << segs[i].gl << " " << segs[i].gr << endl;
    }
    for (int i = 0; i + 1 < (int) segs.size(); i++) {
        if (segs[i].r >= segs[i + 1].l) {
            cout << "NIE\n";
            return;
        }
    }
    int holes = 0;
    for (int i = 0; i + 1 < (int) segs.size(); i++) {
        if (segs[i].gr || segs[i + 1].gl) {
            continue;
        }
        if (segs[i].r + 1 != segs[i + 1].l) {
            holes++;
        }
    }
    int free = l;
    for (int i = 1; i + 1 < (int) segs.size(); i++) {
        free -= segs[i].r - segs[i].l + 1;
    }
    cerr << "holes = " << holes << " free = " << free << endl;
    if (holes > u) {
        cout << "NIE\n";
        return;
    }
    if (free < u) {
        cout << "NIE\n";
        return;
    }
    cout << "TAK\n";
}

signed main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while (t --> 0) {
        solve();
    }
    return 0;
}