#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 = 1;
    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;
            if (y == -1) y = x, mp[x] = 2;
            r -= y - x + 1;
            pa[idx++] = { x, y };
        }
    }
    sort(pa + 1, pa + idx);
    pa[0] = { 0, 0 };
    pa[idx + 1] = { L + 1, L + 1 };
    int num = 0;
    for (int i = 1; i < idx; i++) {
        if (pa[i].fi <= pa[i - 1].se) {
            puts("NIE");
            return;
        }
    }
    if (idx == 1) l++;
    for (int i = 1; i < idx; i++) {
        if (pa[i].fi == pa[i].se) {
            int x = mp[pa[i].fi];
            if (x == 0) {
                continue;
            }
            if (pa[i].fi - 1 > pa[i - 1].se) {
                if (x != 1) l++; 
            }
            if (pa[i].se + 1 < pa[i + 1].fi) {
                if (x != 2) 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;
}