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

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#define FOR(x, b, e) for(int x = (b); x <= (e); x++)
#define FORD(x, b, e) for(int x = (b); x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 1000010;
const int C = 262144;
const int INF = 1000000001;

int n;
vector<PII> A, B, A2, B2;

void test() {
	scanf("%d", &n);
	FOR(i, 1, n) {
		int a, b, l;
		scanf("%d %d %d", &l, &a, &b);
		A.PB(MP(a, l) );
		B.PB(MP(b, l) );
	}
	sort(ALL(A));
	sort(ALL(B));
	
	while(SIZE(A) && SIZE(B) ) {
		PII Al = A.back();
		PII Bl = B.back();
		A.pop_back();
		B.pop_back();
		if(Al.S > Bl.S) {
			A2.PB(MP(Al.F, Bl.S) );
			B2.PB(MP(Bl.F, Bl.S) );
			A.PB(MP(Al.F, Al.S - Bl.S) );
		}
		else if(Al.S < Bl.S) {
			A2.PB(MP(Al.F, Al.S) );
			B2.PB(MP(Bl.F, Al.S) );
			B.PB(MP(Bl.F, Bl.S - Al.S) );	
		}
		else {
			A2.PB(MP(Al.F, Al.S) );
			B2.PB(MP(Bl.F, Bl.S) );
		}
	}

	bool czy = 1;
	LL sumA = 0, sumB = 0;

	FOR(i, 0, SIZE(A2) - 1) {
		sumA += (LL)A2[i].F * A2[i].S;
		sumB += (LL)B2[i].F * B2[i].S;
		if(sumA < sumB)
			czy = 0;
	}

	if(sumA != sumB)
		czy = 0;
	if(czy)
		printf("TAK\n");
	else
		printf("NIE\n");
	A.clear();
	B.clear();
	A2.clear();
	B2.clear();
}

int main() {
	int te = 1;
	scanf("%d", &te);
	while(te--)
		test();
	return 0;
}