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

void solve()
{
    int n, m;
    cin >> n >> m;
    int unk = 0;
    vector<pair<int, int>> v;
    for (int i = 0; i < n; ++i)
    {
        int l, r;
        cin >> l >> r;
        if (l == -1 && r == -1) unk++;
        else v.emplace_back(l, r);
    }
    sort(v.begin(), v.end(),
         [&](auto x, auto y)
         {
             if (x.first == -1) x.first = x.second;
             if (x.second == -1) x.second = x.first;
             if (y.first == -1) y.first = y.second;
             if (y.second == -1) y.second = y.first;
             return x < y;
         });
    int cur = 0, quota = 0, flg = 0, f = 0;
    for (auto e : v)
    {
        if (e.first == -1)
        {
            if (e.second <= cur)
            {
                cout << "NIE\n";
                return;
            }
            quota += e.second - cur - 1;
            cur = e.second;
            flg = 0;
        }
        else if (e.second == -1)
        {
            if (e.first != cur + 1)
            {
                if (e.first <= cur)
                {
                    cout << "NIE\n";
                    return;
                }
                else quota += e.first - cur - 1;
                if (!flg) f++;
            }
            cur = e.first;
            flg = 1;
        }
        else
        {
            if (e.first != cur + 1)
            {
                if (e.first <= cur)
                {
                    cout << "NIE\n";
                    return;
                }
                else quota += e.first - cur - 1;
                if (!flg) f++;
            }
            cur = e.second;
            flg = 0;
        }
    }
    if (quota >= unk && unk >= f) cout << "TAK\n";
    else cout << "NIE\n";
    return;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}