#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;

void solve() {
    int n, L;
    std::cin >> n >> L;

    std::vector <int> a(n), b(n);
    for(int i = 0; i < n; i++) {
        std::cin >> a[i] >> b[i];
    }

    std::vector < std::array <int, 2> > seg;
    std::vector < std::array <int, 2> > p;
    seg.reserve(n);
    p.reserve(n);
    int cnt = 0;
    for(int i = 0; i < n; i++) {
        if(a[i] != -1 && b[i] != -1) {
            seg.push_back({a[i], b[i]});
        } else if(a[i] != -1) {
            p.push_back({a[i], 0});
        } else if(b[i] != -1) {
            p.push_back({b[i], 1});
        } else {
            cnt++;
        }
    }
    std::sort(seg.begin(), seg.end());
    std::sort(p.begin(), p.end());
    for(int i = 1; i < seg.size(); i++) {
        if(seg[i][0] <= seg[i - 1][1]) {
            std::cout << "NIE\n";
            return ;
        }
    }

    int i = 0;
    int cmin = 0;
    int cmax = 0;

    auto work = [&](int l, int r) -> bool {
        int j = i;
        while(i < p.size() && p[i][0] <= r) {
            if(p[i][0] < l) {
                return false;
            }
            i++;
        }
        cmax += r - l + 1 - (i - j);
        if(i == j) {
            cmin++;
        } else {
            for(int k = j + 1; k < i; k++) {
                if(p[k][0] == p[k - 1][0]) {
                    return false;
                }
                if(p[k][0] != p[k - 1][0] + 1 && p[k][1] == 0 && p[k - 1][1] == 1) {
                    cmin++;
                }
            }
            if(p[j][0] != l && p[j][1] == 0) {
                cmin++;
            }
            if(p[i - 1][0] != r && p[i - 1][1] == 0) {
                cmin++;
            }
        }
        return true;
    };
    int l = 1;
    for(auto [a, b] : seg) {
        if(a > l) {
            if(!work(l, a - 1)) {
                std::cout << "NIE\n";
                return ;
            }
        }
        a = b + 1;
    }
    if(l <= L) {
        if(!work(l, L)) {
            std::cout << "NIE\n";
            return ;
        }
    }

    if(i != p.size()) {
        std::cout << "NIE\n";
        return ;
    }

    if(cmin <= cnt && cnt <= cmax) {
        std::cout << "TAK\n";
    } else {
        std::cout << "NIE\n";
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while(t--) {
        solve();
    }

    return 0;
}