#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    while (q--) {
        int n, l;
        cin >> n >> l;
        int cnt = 0;
        bool ok = true;
        vector<pair<int, pair<int, int>>> v;
        for (int i = 0; i < n; ++i) {
            int a, b;
            cin >> a >> b;
            if (a == -1 and b == -1) {
                cnt += 1;
            } else if (a == -1) {
                v.push_back({b, {a, b}});
            } else if (b == -1) {
                v.push_back({a, {a, b}});
            } else {
                if (a > b) ok = false;
                else v.push_back({a, {a, b}});
            }
        }
        sort(v.begin(), v.end());
        auto slv = [&]() -> void {
            int L = 1;
            int uo = 0;
            for (int i = 0; i < v.size(); i++) {
                auto p = v[i].second;
                if (p.first != -1) {
                    if (L != p.first) {
                        if (cnt == 0) {
                            ok = false;
                            return;
                        }
                        cnt -= 1;
                        // [L, p.first-1] を追加
                        uo += (p.first - 1 - L);
                        L = p.first;
                    }
                    if (p.second != -1) {
                        L = p.second + 1;
                    } else {
                        if (i + 1 < v.size()) {
                            uo += v[i + 1].first - L;
                            L = v[i + 1].first;
                        } else {
                            // [L, R] を追加
                            uo += l - L;
                            L = l + 1;
                        }
                    }
                } else {
                    // [L, p.second] を追加
                    uo += p.second - L;
                    L = p.second + 1;
                }
            }
            if (L != l + 1) {
                if (cnt == 0) {
                    ok = false;
                    return;
                }
                cnt -= 1;
                uo += l - L;
            }
            if (cnt > uo) ok = false;
        };
        if (ok) slv();

        if (ok) cout << "TAK\n";
        else cout << "NIE\n";
    }
}