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

#define ll long long
#define ull unsigned long long
#define INF 0x3f3f3f3f

void solve()
{
    int n, L;
    cin >> n >> L;
    vector<pair<int, int>> p2, pl, pr, p0;
    for (int i = 0; i < n; i++)
    {
        int a, b;
        cin >> a >> b;
        if(a == -1 && b == -1)
        {
            p0.push_back({a, b});
        }
        else if(a == -1)
        {
            pr.push_back({a, b});
        }
        else if(b == -1)
        {
            pl.push_back({a, b});
        }
        else
        {
            p2.push_back({a, b});
        }
    }
    sort(p2.begin(), p2.end());
    sort(pr.begin(), pr.end());
    sort(pl.begin(), pl.end());
    for (int i = 1; i < p2.size(); i++)
    {
        if(p2[i].first <= p2[i - 1].second)
        {
            cout << "NIE\n";
            return;
        }
    }
    for (int i = 1; i < pl.size(); i++)
    {
        if(pl[i].first == pl[i - 1].first)
        {
            cout << "NIE\n";
            return;
        }
    }
    for (int i = 1; i < pr.size(); i++)
    {
        if(pr[i].second <= pr[i - 1].second)
        {
            cout << "NIE\n";
            return;
        }
    }
    for (auto [x, _] : pl)
    {
        int p = upper_bound(p2.begin(), p2.end(), make_pair(x, INF)) - p2.begin();
        if(p == 0)
            continue;
        p--;
        if(p2[p].second >= x)
        {
            cout << "NIE\n";
            return;
        }
    }
    for (auto [_, x] : pr)
    {
        int p = upper_bound(p2.begin(), p2.end(), make_pair(x, INF)) - p2.begin();
        if(p == 0)
            continue;
        p--;
        if(p2[p].second >= x)
        {
            cout << "NIE\n";
            return;
        }
    }
    int tot_1 = p0.size();
    vector<pair<int, int>> a;
    a.insert(a.end(), p2.begin(), p2.end());
    a.insert(a.end(), pl.begin(), pl.end());
    a.insert(a.end(), pr.begin(), pr.end());
    sort(a.begin(), a.end(), [](const pair<int, int> &x, const pair<int, int> &y)
         { int keyx = x.first == -1 ? x.second : x.first;
            int keyy = y.first == -1 ? y.second : y.first;
            return keyx < keyy; });
    int tot = 0;
    for (int i = 0; i + 1 < a.size(); i++)
    {
        int p1 = a[i].second == -1 ? a[i].first : a[i].second;
        int p2 = a[i + 1].first == -1 ? a[i + 1].second : a[i + 1].first;
        tot += p2 - p1 - 1;
    }
    if(tot >= tot_1)
        cout << "TAK\n";
    else
        cout << "NIE\n";
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}