#include<bits/stdc++.h>
#define int long long
#define db double
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 4e5 + 999;
int n, L, m, ok[N], l[N], r[N];
pii p[N];
void solve() {
    cin >> n >> L;
    m = 0;
    int s = 0;
    bool flag = 1;
    for (int i = 1; i <= n; i++){
        cin >> l[i] >> r[i];
        if(l[i] != -1 && r[i] != -1){
            ok[i] = 3;
            p[++m] = make_pair(l[i], i);
        }
        else if(l[i] != -1){
            ok[i] = 1;
            p[++m] = make_pair(l[i], i);
        }
        else if(r[i] != -1){
            ok[i] = 2;
            p[++m] = make_pair(r[i], i);
        }
        else
            s++;
    }
    p[++m] = make_pair(0, m);
    p[++m] = make_pair(L + 1, m);
    ok[m] = ok[m - 1] = 3;
    sort(p + 1, p + m + 1);
    int nd = 0, s1 = 0;
    for (int i = 2; i <= m; i++){
        auto [x, id] = p[i];
        auto [xx, lid] = p[i - 1];
        //cout << id << ' ';
        if(ok[lid] == 3)
            xx = r[lid];
        if(x <= xx){
            flag = 0;
            break;
        }
        if(ok[lid] == 1){
            if(ok[id] == 2){
                s1 += x - xx - 1;
            }
            else {
                s1 += x - xx - 1;
            }
        }
        else {
            if(ok[id] == 2){
                s1 += x - xx - 1;
            }
            else {
                if(x - xx > 1)
                    nd++;
                s1 += (x - xx - 1);
            }
        }
    }
    if(s < nd || s > s1)
        flag = 0;
    if(flag)
        cout << "TAK\n";
    else
        cout << "NIE\n";
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}