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
/*
 *  Copyright (C) 2019  Paweł Widera
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details:
 *  http://www.gnu.org/licenses/gpl.html
 */
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, t;
	int capacity, have, wants;
	int min_have, max_have, min_wants, max_wants;
	long long int total_have, total_wants;

	cin >> t;
	while (--t >= 0) {
		total_have = total_wants = 0;
		min_have = min_wants = 1000000;
		max_have = max_wants = 1;

		cin >> n;
		for (int i = 0; i < n; ++i) {
			cin >> capacity >> have >> wants;

			min_have = min(min_have, have);
			max_have = max(max_have, have);
			min_wants = min(min_wants, wants);
			max_wants = max(max_wants, wants);

			total_have += capacity * have;
			total_wants += capacity * wants;
		}

		if (total_have != total_wants || min_wants < min_have || max_wants > max_have) {
			cout << "NIE" << endl;
		} else {
			cout << "TAK" << endl;
		}
	}
	return 0;
}