#include<bits/stdc++.h>

using namespace std;

// #define int long long 
#define endl '\n'

bool solve() {
    int n, L, mn = 0, mx = 0, cnt = 0;
    cin >> n >> L;
    vector<pair<int, int>> v4, v23;
    vector<pair<int, int>> st;
    for(int i = 1; i <= n; i++) {
        int a, b;
        cin >> a >> b;
        if(a == -1 && b == -1)
            cnt++;
        else if(a == -1) {
            v23.push_back({b, 2});
            mx--;
        }
        else if(b == -1) {
            v23.push_back({a, 1});
            mx--;
        }
        else
            v4.push_back({a, b});
    }
    int lst = 0;
    sort(v4.begin(), v4.end());
    sort(v23.begin(), v23.end());
    for(auto [a, b] : v4) {
        if(lst >= a) {
            // cout << "ga?" << endl;
            return 0;
        }
        if(lst + 1 <= a - 1) {
            st.push_back({lst + 1, a - 1});
            mx += a - 1 - lst;
        }
        lst = b;
    }
    if(lst + 1 <= L) {
        st.push_back({lst + 1, L});
        mx += L - lst;
    }
    int j = 0;
    for(int i = 0; i < v23.size(); i++) {
        auto [x, tp] = v23[i];
        while(j < st.size() && st[j].second < x) {
            if(st[j].first <= st[j].second)
                mn++;
            j++;
        }
        if(j >= st.size()) {
            // cout << "why?" << endl;
            return 0;
        }
        if(tp == 2) {
            //[-1, x]
            if(st[j].first > x) {
                // cout << "QAQ" << endl;
                return 0;
            }
            st[j].first = x + 1;
        } else {
            //[x, -1]
            if(st[j].first > x) {
                // cout << "QaQ" << endl;
                return 0;
            }
            if(st[j].first < x) mn++;
            st[j].first = st[j].second + 1;
            if(i + 1 < v23.size())
                st[j].first = min(st[j].first, v23[i + 1].first);
        }
    }
    while(j < st.size()) {
        if(st[j].first <= st[j].second)
            mn++;
        j++;
    }
    // cout << "min = " << mn << "  max = " << mx << endl;
    if(cnt < mn || cnt > mx)
        return 0;
    return 1;
}

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

    int t;
    cin >> t;
    while (t--) {
        if(solve())
            cout << "TAK" << endl;
        else
            cout << "NIE" << endl;
    }
    return 0;
}