#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int T, n, m;
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m);

        int cnt = 0;
        vector<pair<int, int>> vec;

        for (int i = 1;i <= n;i++) {
            int L, R;
            scanf("%d%d", &L, &R);
            if (L == -1 && R == -1) cnt++;
            else vec.push_back(make_pair(L, R));
        }

        if (vec.size() == 0) { printf(cnt <= m ? "TAK\n" : "NIE\n"); continue; }

        sort(vec.begin(), vec.end(), [](pair<int, int> x, pair<int, int> y) -> bool {
            int xval = (x.first != -1 ? x.first : x.second);
            int yval = (y.first != -1 ? y.first : y.second);
            return xval < yval;
            });

        vector<bool> f(vec.size(), false);
        for (int i = 0;i < vec.size();i++)
            f[i] = (vec[i].first == -1 || vec[i].second == -1);

        bool flag = true;
        int maxcnt = 0, mincnt = 0;
        int k = vec.size();

        // for (auto& p : vec) {
        //     printf("vec : %d %d\n", p.first, p.second);
        // }

        if (vec[0].first == -1) {
            vec[0].first = 1;
        }
        else {
            if (vec[0].first != 1) mincnt++;
            maxcnt += vec[0].first - 1;
        }

        if (vec[k - 1].second == -1) {
            vec[k - 1].second = m;
        }
        else {
            if (vec[k - 1].second != m) mincnt++;
            maxcnt += m - vec[k - 1].second;
        }

        // printf("min/max = (%d, %d)\n", mincnt, maxcnt);

        for (int i = 0;i < k;i++) {
            if (vec[i].first == -1) {
                vec[i].first = vec[i - 1].second + 1;
            }
            if (vec[i].second == -1) {
                if (vec[i + 1].first == -1) vec[i].second = vec[i].first;
                else vec[i].second = vec[i + 1].first - 1;
            }

            if (i != 0) {
                if (vec[i].first > vec[i - 1].second + 1) {
                    mincnt++;
                    maxcnt += (vec[i].first) - (vec[i - 1].second + 1);
                }
                if (vec[i].first < vec[i - 1].second + 1) {
                    flag = false;
                    break;
                }
            }

            if (f[i]) maxcnt += vec[i].second - vec[i].first;
            // printf("Get inteval : %d %d (f = %d)\n", vec[i].first, vec[i].second, (int)f[i]);
            // printf("min/max = (%d, %d)\n", mincnt, maxcnt);
        }

        if (flag && mincnt <= cnt && maxcnt >= cnt) {
            printf("TAK\n");
        }
        else {
            printf("NIE\n");
        }
    }
}