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
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<pii, ll> tri;
typedef pair<pii, pii> quadro;

vector<pii> herb;

bool check() {

    ll balance = 0;

    for(ll i=0; i<herb.size(); i++) {

        balance -= herb[i].second;
        //cout << balance << " ";
        if(balance < 0) {
            return false;
        }
    }

    //cout << "\n";

    if(balance != 0) {
        return false;
    }
    else {
        return true;
    }

}

int main() {
    ios_base::sync_with_stdio(0);

    ll testy;
    cin >> testy;


    while(testy--) {

        //cout << "\n";
        herb.clear();

        ll n;
        cin >> n;

        for(ll i=0; i<n; i++) {
            ll l, a, b;
            cin >> l >> a >> b;

            herb.push_back(pii(min(a, b), -((b-a) * l)));
        }

        sort(herb.begin(), herb.end());

        if(check()) {
            cout << "TAK\n";
        }
        else {
            cout << "NIE\n";
        }


    }

    return 0;

}