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
#include <bits/stdc++.h>

using namespace std;

constexpr int INF = 1000000000;

int main(){
    ios_base::sync_with_stdio(0);
	cin.tie(0);
    cout.tie(0);

    int q;
    cin>> q;
    while(q--){
        int n;
        cin>> n;
        long long max1 = INF;
        long long max2 = INF;
        long long min1 = INF;
        long long min2 = INF;
        max1 *= -1;
        max2 *= -1; 
        long long owned = 0, required = 0;
        for(int i=0; i<n; i++){
            long long l, a, b;
            cin>> l >> a >> b;
            owned += l*a;
            required += l*b;
            max1 = max(max1, a);
            max2 = max(max2, b);
            min1 = min(min1, a);
            min2 = min(min2, b);
        }
        //cout<< owned << ' ' << required << '\n';
        if(owned != required || max1 < max2 || min1 > min2) cout<< "NIE\n";
        else cout<< "TAK\n";
    }

    return 0;
}