#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#define fi first
#define se second
using namespace std;
const int N = 2e5 + 10;
typedef pair<int, int> PII;

PII pa[N];

void solve() {
    int n, L;
    scanf("%d%d", &n, &L);
    int un_def = 0;
    int idx = 0;
    map<int, int> mp;
    int l = 0, r = L;
    for (int i = 0; i < n; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        if (y == -1 && x == -1) un_def++;
        else {
            if (x == -1) x = y, mp[x] = 1, l++;
            if (y == -1) y = x, mp[x] = 2, l++;
            r -= y - x + 1;
            pa[idx++] = { x, y };
        }
    }
    sort(pa, pa + idx);
    int num = 0;
    for (int i = 1; i < idx; i++) {
        if (pa[i].fi <= pa[i - 1].se) {
            puts("NIE");
            return;
        }
        if (pa[i].fi > pa[i - 1].se + 1) num++;
    }
    if (idx) {
        if (L > pa[idx - 1].se) num++;
        if (pa[0].fi > 1) num++;
    } else num++;
    for (int i = 0; i < idx - 1; i++) {
        if (pa[i].fi == pa[i].se && pa[i + 1].fi == pa[i + 1].se)
        if (mp[pa[i].fi] == 2 && mp[pa[i + 1].fi] == 1) l--;
    }
    l = num - l;
    if (un_def >= l && un_def <= r) puts("TAK");
    else puts("NIE");
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}