#include <bits/stdc++.h>

using namespace std;

/*****************************************************************   Template Start  **************************************************************************/



/*****************************************************************    Define Start   **************************************************************************/
typedef long long                               ll;
typedef unsigned long long                      ull;
#define int                                     long long
#define itn                                     int
#define endl                                    '\n'
#define Endl                                    endl
#define ednl                                    endl
#define al(a)                                   (a).begin(),(a).end()
#define all(a)                                  (a).begin()+1,(a).end()
#define debug(x)                                {cerr<<"ss:"<<x<<endl;}
#define qdebug(x)                               {cerr<<"ss:";for(auto i:x)cout<<i<<" ";cout<<endl;}
#define lowbit(x)                               (x&-x)
#define vi                                      vector<int>
#define pii                                     pair<int,int>
#define pb                                      push_back
#define fs                                      first
#define sc                                      second


constexpr long long maxlonglong = 9223372036854775807;   //9e18
constexpr int maxint = 2147483647;      //2e9
constexpr int INF = 0x7f7f7f7f; //2139062143
constexpr int M = 1e9 + 7;
constexpr int mod =  998244353;
constexpr int p = 0x1F351F35; // good hash number.
const double pi = acos(-1.0);

mt19937_64 rnd(time(0));
constexpr int N=1231564;



inline void solve(){
    int n,L;cin>>n>>L;
    vector<array<int,3>> a;
    int cnt=0;
    for(int i=1;i<=n;i++){
        int x,y;cin>>x>>y;
        if(x==-1&&y==-1)cnt++;
        else if(x==-1){
            a.push_back({y,y,1});
        }
        else if(y==-1){
            a.push_back({x,x,2});
        }
        else a.push_back({x,y,0});
    }
    sort(al(a));
    int l=0,mx=L;
    for(int i=0;i<a.size();i++){
        mx-=a[i][1]-a[i][0]+1;
        if(a[i][0]==l+1){
            l=a[i][1];
        }
        else {
            if(a[i-1][2]==2||a[i][2]==1){
                l=a[i][1];
            }
            else if(cnt){
                l=a[i][1];
                cnt--;
            }
            else {
                cout<<"NIE"<<endl;
                return;
            }
        }
    }
    if(cnt>mx){
        cout<<"NIE"<<endl;
        return;
    }
    if(a.size()==0&&cnt){
        cout<<"TAK"<<Endl;
        return;
    }
    if(l==L){
        cout<<"TAK"<<Endl;
        return;
    }
    if(a.back()[2]==2||cnt){
        cout<<"TAK"<<Endl;
        return;
    }
    else cout<<"NIE"<<endl;
}





signed main()
{
    //freopen("E:\work tool\code document\data\input.in", "r", stdin);
	//freopen("E:\work tool\code document\data\output.out", "w", stdout);
    ios::sync_with_stdio(false);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);    //关闭同步  如果使用 则不要使用<cstdio>
    // cout << fixed << setprecision(10);
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}