#include <iostream>
#include <algorithm>
#include <cstdio>
#include <array>
#include <set>
using namespace std;
#ifdef ONLINE_JUDGE

#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++)
char buf[1 << 23], *p1 = buf, *p2 = buf, ubuf[1 << 23], *u = ubuf;

#endif
int read() {
    int p = 0, flg = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') flg = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        p = p * 10 + c - '0';
        c = getchar();
    }
    return p * flg;
}
void write(int x) {
    if (x < 0) {
        x = -x;
        putchar('-');
    }
    if (x > 9) {
        write(x / 10);
    }
    putchar(x % 10 + '0');
}
bool _stmer;

class Node {

public:

    bool flg1, flg2;
    int l, r;

    Node (bool _flg1, bool _flg2, int _l, int _r) : flg1(_flg1), flg2(_flg2), l(_l), r(_r) {}

    bool operator <(const Node &t) const { return l < t.l; }
};

set <Node> isl;

void solve() {
    isl.clear();
    int n = read(), m = read();
    int res = 0;
    for (int i = 1; i <= n; i++) {
        int x = read(), y = read();
        if (x == -1 && y == -1) { res++; continue; };
        Node now(0, 0, 0, 0);
        if (x == -1) now.flg1 = 1, x = y;
        if (y == -1) now.flg2 = 1, y = x;
        now.l = x, now.r = y;
        isl.insert(now);
    }
    isl.insert(Node(0, 0, 0, 0));
    isl.insert(Node(0, 0, m + 1, m + 1));
    int tp0 = 0, tp1 = 0;
    for (auto it = isl.begin(); next(it, 1) != isl.end(); it++) {
        auto et = next(it, 1);
        if (it -> r + 1 == et -> l) continue;
        if (et -> l < it -> r) { return (void)puts("NIE"); }
        tp0 += (!it -> flg2) && (!et -> flg1);
        tp1 += et -> l - it -> r - 1;
    }
    if (tp0 <= res && res <= tp1)
        puts("TAK");
    else
        puts("NIE");
}

bool _edmer;
int main() {
    cerr << (&_stmer - &_edmer) / 1024.0 / 1024.0 << "MB\n";
    int T = read();
    while (T--) solve();
    return 0;
}