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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define f first
#define s second

const int N = 100005;
int q, n, i;
ll v, a, b, load;
vector < pair <ll,ll> > t1, t2;

bool solve ()
	{
	scanf ("%d", &n);
	t1.clear();
	t2.clear();
	for (i=0; i<n; i++)
		{
		scanf ("%lld%lld%lld", &v, &a, &b);
		t1.push_back({a, v});
		t2.push_back({b, v});
		}
	
	sort(t1.begin(), t1.end());
	sort(t2.begin(), t2.end());
	
	load = 0;
	
	while (!t1.empty() || !t2.empty())
		{
		a = min(t1.back().s, t2.back().s);
		b = t1.back().f - t2.back().f;
		
		load += a*b;
		
		if (load < 0)
			return false;
		
		t1.back().s -= a;
		t2.back().s -= a;
		
		if (t1.back().s == 0) t1.pop_back();
		if (t2.back().s == 0) t2.pop_back();
		}
	
	return (load==0);
	}

int main ()
	{
	scanf ("%d", &q);
	while (q--)
		printf ("%s\n", solve() ? "TAK" : "NIE");
	return 0;
	}