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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=1010000;

int n,_,l,a,b;
PII p[N],q[N];
bool solve() {
	scanf("%d",&n);
	for (int i=0;i<n;i++) {
		scanf("%d%d%d",&l,&a,&b);
		p[i]=mp(a,l);
		q[i]=mp(b,l);
	}
	sort(p,p+n);
	sort(q,q+n);
	ll s=0;
	int c1=0,c2=0;
	while (c1<n&&c2<n) {
		int rem=min(p[c1].se,q[c2].se);
		p[c1].se-=rem; q[c2].se-=rem;
		s+=(ll)rem*(p[c1].fi-q[c2].fi);
		if (s>0) return 0;
		if (p[c1].se==0) c1++;
		if (q[c2].se==0) c2++;
	}
	return s==0;
}

int main() {
	for (scanf("%d",&_);_;_--) {
		puts(solve()?"TAK":"NIE");
	}
}