#include <bits/stdc++.h>
using namespace std;

const int MAXN = 2e5 + 2;
struct segment {
    int l, r;
    int idx;
    segment(int a, int b, int c) : l(a), r(b), idx(c) {}
    segment() : l(0), r(0), idx(0) {}  // Default constructor added
};

segment pointers[MAXN];  // Array of segment objects

bool cmp(segment x, segment y) {
    return x.l < y.l;
}

void returnable() {
    int n, finall; 
    cin >> n >> finall;
    
    int free = 0, badseg = 0;
    for (int i = 1; i <= n; i++) {
        int a, b; 
        cin >> a >> b;
        
        if (a == -1 || b == -1) {
            free++;
            continue;  // Skip this segment without decrementing `badseg`
        } 
        badseg++;
        if (a == -1) {
            pointers[badseg] = segment(b, b, 1);
        } else if (b == -1) {
            pointers[badseg] = segment(a, a, 2);
        } else {
            pointers[badseg] = segment(a, b, 3);
        }
    }

    if (badseg == 0) {
        if (finall < badseg) cout << "TAK\n";
        else cout << "NIE\n";
        return; 
    }

    sort(pointers + 1, pointers + badseg + 1, cmp);

    int curr = 0, cnt = 0, lft = finall;
    
    if (pointers[1].l != 1 && pointers[1].idx != 1) cnt++;

    for (int i = 1; i <= badseg; i++) {  // Start loop from i=2
        if (pointers[i].l == pointers[i-1].l || pointers[i].r == pointers[i-1].r) {
            cout << "NIE\n"; 
            return;
        }
        if (pointers[i].l <= curr) {
            cout << "NIE\n"; 
            return;
        }
        if (pointers[i].idx != 1) {
            if (pointers[i-1].idx == 3 || pointers[i-1].idx == 1) {
                if (pointers[i-1].r != pointers[i].l - 1) cnt++;
            }
        }
        lft -= pointers[i].r - pointers[i].l + 1;
        curr = pointers[i].r;
    }
    
    if (pointers[badseg].r != finall && pointers[badseg].idx != 2) cnt++;

    if (cnt > free || lft < free) {
        cout << "NIE\n";
    } else {
        cout << "TAK\n";
    }
}

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

    int t; 
    cin >> t;
    while (t--) {
        returnable();
    }
    return 0;
}