1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using pll=pair<ll, ll>;
using vi=vector<int>;
using vll=vector<ll>;

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<" = "<<h<<endl; }
#ifdef LOCAL
#define _upgrade ios_base::sync_with_stdio(0);
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__);
#else
#define _upgrade ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define debug(...) 98;
#define cerr if(0) cout
#endif

#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second

#define erase_duplicates(x) sort(all(x)), (x).resize(distance((x).begin(), unique(all(x))));

#define watch(x) cout << (#x) << " is " << (x) << endl;

#define pow2(x) ((x)*(x))
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))

#define REP(i, a, b) for(int i = a; i <= b; ++i)
#define REPV(i, b, a) for(int i = b; i >= a; --i)

const double m_pi = acos(-1.0);
const int int_max = 0x3f3f3f3f;
const int M7 = 1000*1000*1000+7;
const int M9 = 1000*1000*1000+9;

int l[100009], a[100009], b[100009];
long long reqpow[100009];
long long curpow[100009];


vector<pii> dane, brane;

void solve(){
    int n;cin>>n;
    dane.clear();
    brane.clear();
    REP(i, 0, n-1){
        cin>>l[i]>>a[i]>>b[i];
        dane.pb({a[i], l[i]});
        brane.pb({b[i], l[i]});
    }
    sort(all(dane));
    sort(all(brane));

    int pos=0;
    REP(i, 0, sz(brane)-1){
        reqpow[i]=brane[i].first*brane[i].second;
        curpow[i]=0;
        while(pos < sz(dane)){
            int add=min(dane[pos].second, brane[i].second);
            brane[i].second-=add;
            dane[pos].second-=add;
            curpow[i]+=add*dane[pos].first;
            if(brane[i].second==0)break;
            if(dane[pos].second==0)++pos;
        }
    }
    int posr=0;
    int posl=0;//cerr<<"!!!"<<endl;
    while(posr<n && posl<=posr){//cerr<<posl<<" "<<posr<<endl;
        if(reqpow[posr]>=curpow[posr]){
            ++posr;//cerr<<"a"<<endl;
        }
        else if(reqpow[posl]<=curpow[posl]){
            ++posl;//cerr<<"b"<<endl;
        }
        else{//cerr<<"c"<<endl;
            long long add= min(reqpow[posl]-curpow[posl], curpow[posr]-reqpow[posr]);
            curpow[posl]+=add;//cerr<<add<<endl;
            curpow[posr]-=add;
        }
    }

    REP(i, 0, n-1){
        if(reqpow[i]!=curpow[i]){
            cout<<"NIE\n";
            return;
        }
    }

    cout<<"TAK\n";
    return;
}

int main(){
    _upgrade
    cout<<fixed<<setprecision(15);

    int t;cin>>t;
    while(t--)solve();


    return 0;
}




/*
    __builtin_popcount count total set bits on a given integer
    (use __builtin_popcountll for long long).


*/