#include <bits/stdc++.h>
using namespace std;
void Do() {
    int n, MX, cnt = 0;
    cin >> n >> MX;
    vector<pair<int, int>> A;
    for(int i = 1; i <= n; ++ i) {
        int a, b;
        cin >> a >> b;
        if(a == -1 && b == -1) {
            ++ cnt;
            continue;
        }
        A.push_back({a, b});
    }
    A.push_back({0, 0});
    A.push_back({MX + 1, MX + 1});
    sort(A.begin(), A.end(), [](auto x, auto y) {
        auto [a, b] = x;
        auto [c, d] = y;
        return max(a, b) < max(c, d);
    });
    int L = 0, R = 0;
    for(int i = 0; i + 1 < A.size(); ++ i) {
        auto [a, b] = A[i];
        auto [c, d] = A[i + 1];
        if(a >= c && a != -1 && c != -1) {
            cout << "NIE\n";
            return;
        }
        if(b >= d && b != -1 && d != -1) {
            cout << "NIE\n";
            return;
        }
        if(a >= c && a != -1 && c != -1) {
            cout << "NIE\n";
            return;
        }
        if(b >= d && b != -1 && d != -1) {
            cout << "NIE\n";
            return;
        }
        if(c == -1) c = 1e9;
        if(d == -1) d = 1e9;
        int mx = max(a, b), mn = min(c, d);
        if(mx + 1 < mn && b != -1 && c != -1) {
            ++ L;
        }
        {
            R += mn - mx - 1;
        }
    }
    // cerr << L << " " << R << endl;
    if(L <= cnt && cnt <= R) {
        cout << "TAK\n";
    }
    else {
        cout << "NIE\n";
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T; cin >> T;
    while(T --) {
        Do();
    } 
}