#include <bits/stdc++.h>
#define No() return cout<<"NIE\n",void()
typedef long long ll;
using namespace std;
int T,n;
struct vec{
	ll x,y;
}s[1000010],t[1000010];
void sol(){
	cin>>n;
	ll sum=0;
	for(int i=0,l,a,b;i<n;i++) cin>>l>>a>>b,s[i]={l,1ll*l*a},t[i]={l,1ll*l*b},sum+=1ll*l*(a-b);
	if(sum) No();
	sort(s,s+n,[](vec a,vec b){return a.y/a.x>b.y/b.x;});
	sort(t,t+n,[](vec a,vec b){return a.y/a.x>b.y/b.x;});
	ll ay=0,by=0,ax=0,bx=0;
	for(int i=0,j=0;i<n;i++){
		bx+=t[i].x,by+=t[i].y;
		while(s[j].x+ax<bx) ax+=s[j].x,ay+=s[j].y,j++;
		if(ay+(bx-ax)*(s[j].y/s[j].x)<by) No();
	}
	cout<<"TAK\n";
} 
int main(){
	ios::sync_with_stdio(0);
	cin>>T;
	while(T--) sol(); 
}
/*#include <bits/stdc++.h>
#define No() return cout<<"NIE\n",void()
typedef long long ll;
using namespace std;
int T,n;
struct vec{
	ll x,y;
}s[1000010],t[1000010];
void sol(){
	cin>>n;
	ll sum=0;
	cout<<"TAK\n";
} 
int main(){
	ios::sync_with_stdio(0);
	cin>>T;
	while(T--) sol(); 
}*/