#include <bits/stdc++.h>
using namespace std;
int n , L;
typedef pair<int,int> pii;
void solv() {
    cin >> n >> L;
    vector<pii> v;
    int cnt = 0;
    for(int i = 1;i <= n;i++) {
        int a,b;cin >> a >> b;
        if(a == -1 && b == -1) cnt++ ;
        else v.push_back({a , b});
    }
    sort(v.begin() , v.end() , [&](pii a,pii b) {
        return max(a.first , a.second) < max(b.first , b.second) ;
    });
    int lst = 0;
    int mn = 0 , mx = 0;
    v.push_back({L + 1 , L + 1}) ;
    for(int i = 0;i < v.size();i++) {
        if(i == 0 || v[i - 1].second != -1) {
            if(v[i].first == -1) {
                if(v[i].second <= lst) {cout << "NIE\n" ; return ;}
                mx += v[i].second - lst - 1 ;
            }
            else {
                if(v[i].first <= lst) {cout << "NIE\n" ; return ;}
                mn += v[i].first - lst - 1;
                mx += v[i].first - lst - 1;
            }
        }
        else {
            if(v[i].first == -1) {
                if(v[i].second <= lst + 1) {cout << "NIE\n" ; return ;}
                mx += v[i].second - lst - 2;
            }
            else {
                if(v[i].first <= lst) {cout << "NIE\n" ; return ;}
                mx += v[i].first - lst - 1;
            }
        }
        lst = max(v[i].first , v[i].second) ;
    }
    if(mn <= cnt && cnt <= mx) {
        cout << "TAK\n" ; return ;
    }
    cout << "NIE\n" ;
}
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    int t;cin >> t;
    while(t--) solv() ;
}