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

using namespace std;

void Solve() {
    int n;
    cin >> n;
    long long lewa = 0;
    long long prawa = 0;
    long long mini1, mini2, maksi1, maksi2;
    for (int i = 0; i < n; i++) {
        long long l, a, b;
        cin >> l >> a >> b;
        lewa += l*a;
        prawa += l*b;
        if (i == 0) {
            mini1 = a;
            maksi1 = a;
            mini2 = b;
            maksi2 = b;
        } else {
            mini1 = min(mini1, a);
            mini2 = min(mini2, b);
            maksi1 = max(maksi1, a);
            maksi2 = max(maksi2, b);
        }
    }
    if (lewa != prawa || mini2 < mini1 || maksi2 > maksi1){
        cout << "NIE\n";
    }
    else {
        cout << "TAK\n";
    }
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T --> 0) {
        Solve();
    }
    return 0;
}