#include <bits/stdc++.h>
using namespace std;

#define sws std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define int long long int
#define float long double
#define ld long double
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define vpii vector<pair<int, int>> 
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define in(v) for(auto & x : v) cin >> x;
#define out(v) for(auto x : v) cout << x << ' ';
#define tiii tuple<int, int, int>

const int MAX = 3e5+1;
const int INF = INT32_MAX;
int MOD = 998244353;
const int LOG = 31;
const ld PI = acos(-1);
const int MINF = INT32_MIN;
vpii dirs = {{1, 0}, {-1, 0}};
vpii dirs1 = {{0, 1}, {0, -1}};

// Contest patrocinado por Summer

void solve() {

    int n, l, jokers = 0, needToBeFree = 0; cin >> n >> l;

    vpii sweep; // {iniInter, -1 ou 1 (l ou r)}
    vector<bool> marks(n);

    for(int i = 0; i < n; i++){

        int li, ri; cin >> li >> ri;

        if(ri == li && ri == -1) {jokers++; continue;}
        if(ri != -1) sweep.emplace_back(ri, i);
        else marks[i] = true;
        if(li != -1) sweep.emplace_back(li, -i);
        else marks[i] = true;
    }
    if(n > l){cout << "NIE\n"; return;}

    sort(all(sweep));

    int last = 0, free = 0;
    int opend = -1;
    bool flag = false;

    for(auto[x, y] : sweep){

        // cout << " - " << last << " " << x << '\n';
        // cout << free << '\n';

        if(last == x && opend != y){cout << "NIE\n"; return;}
        if(y > 0){

            if(opend == -1){

                // cout << "A " << x-last-1 << '\n';
                free += x - last - 1;
                if(!flag && x-last-1) needToBeFree++;
                flag = true;
            } else{

                if(opend == y){

                    opend = -1;
                    last = x;
                    flag = false;
                    continue;
                }

                cout << "NIE\n";
                return;
            }
            last = x;
            continue;
        }

        if(opend != -1){

            cout << "NIE\n";
            return;
        }
        opend = -y;
        // cout << "B " << x-last-1 << '\n';

        free += x - last - 1;
        if(marks[-y]) {flag = true; opend = -1;}
        if(!flag && x-last-1) needToBeFree++;

        last = x;
    }

    free += l - last;
    if(!flag && l - last) needToBeFree ++;

    // cout << free << " == " << needToBeFree << '\n';

    if(needToBeFree > jokers || free < jokers){cout << "NIE\n"; return;}
    cout << "TAK\n";
}
int32_t main() { 
    sws;
    int t = 1;
    cin >> t;

    while(t--)
        solve();

return 0;
}