//by 72
#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define Fd(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define pii pair<int, int>
#define fi first
#define se second
#define int long long
using namespace std;

const int mod = 998244353;
const int N = 2e5 + 10;
const int inf = 1e18;
typedef array<int, 3> a3; 
typedef long long ll;

int n, m;

map<int, int> f;
int lowbit(int x) {return x & -x;}
void add(int x, int d) {
    for(; x <= m; x += lowbit(x)) f[x] += d;
}
int cal(int x) {
    int res = 0;
    for(; x; x -= lowbit(x)) res += f[x];
    return res;
}
void update(int l, int r, int d) {
    add(l, d), add(r + 1, -d);
}


void sol() {
    f.clear();
    cin >> n >> m;
    int tot = 0;
    vector<pii> a;
    F(i, 1, n) {
        int x, y; cin >> x >> y;
        if(x == -1 && y == -1) tot ++;
        else a.push_back({x, y});
    }
    vector<pii> b;

    for(auto [l, r] : a) {
        int tmp = max(l, r);
        if(l == -1 || r == -1) update(tmp, tmp, 1), b.pb({tmp, tmp});
        else update(l, r, 1), b.pb({l, r});
    }
    for(auto [l, r] : a) {
        if(l != -1) {
            int qaq = cal(l);
            if(qaq != 1) {
                cout << "NIE\n";
                return;
            }
        } 
        if(r != -1) {
            int qaq = cal(r);
            if(qaq != 1) {
                cout << "NIE\n";
                return;
            }
        }
    }

    int cnt = 0, lst = 0;
    sort(b.begin(), b.end());
    for(auto [l, r] : b) {
        cnt += l - lst - 1;
        lst = r;
    }
    cnt += m - lst;
    if(cnt >= tot) cout << "TAK\n";
    else cout << "NIE\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}
//sldl