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
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <bits/stdc++.h>
using namespace std;
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define pb pop_back
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i)
#define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i)

#define Sim template<class n
Sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
Sim> auto operator << (ostream &p, n y) -> 
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type 
{int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
Sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
Sim, class s> void mini(n &p, s y) {if(p>y) p = y;}
Sim, class s> void maxi(n &p, s y) {if(p<y) p = y;}
#ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
#else
#define debug(...)
#endif 

#define int LL
#define I(x) #x " = ", (x), " "
#define A(a, i) #a "[" #i " = ", i, "] = ", a[i], " "

int n, lol, tak, nie;

void solve()
{
	scanf("%lld", &n);
	int sum1 = 0, sum2 = 0;
	VPII V1, V2;
	FOR(i, 1, n)
	{
		int l, a, b;
		scanf("%lld%lld%lld", &l, &a, &b);
		sum1 += l * a;
		sum2 += l * b;
		V1.PB(MP(a, l));
		V2.PB(MP(b, l));
	}
	if (sum1 != sum2)
	{
		lol++;
		printf("NIE\n");
		return;
	}
	sort(ALL(V1));
	sort(ALL(V2));
	int v1 = 0, v2 = 0, s1 = 0, s2 = 0, ind = 0, done = 0;
	FOR(i, 0, SIZ(V2) - 1)
	{
		v2 += V2[i].s;
		s2 += V2[i].f * V2[i].s;
		while (v1 < v2)
		{
			if (V1[ind].s - done <= v2 - v1)
			{
				s1 += (V1[ind].s - done) * V1[ind].f;
				v1 += (V1[ind].s - done);
				done = 0;
				ind++;
			}
			else
			{
				int diff = v2 - v1;
				s1 += diff * V1[ind].f;
				v1 += diff;
				done += diff;
			}
		}
		if (s1 > s2)
		{
			nie++;
			printf("NIE\n");
			return;
		}
	}
	v1 = v2 = s1 = s2 = done = 0;
	ind = SIZ(V1) - 1;
	FORD(i, SIZ(V2) - 1, 0)
	{
		v2 += V2[i].s;
		s2 += V2[i].f * V2[i].s;
		while (v1 < v2)
		{
			if (V1[ind].s - done <= v2 - v1)
			{
				s1 += (V1[ind].s - done) * V1[ind].f;
				v1 += (V1[ind].s - done);
				done = 0;
				ind--;
			}
			else
			{
				int diff = v2 - v1;
				s1 += diff * V1[ind].f;
				v1 += diff;
				done += diff;
			}
		}
		if (s1 < s2)
		{
			nie++;
			printf("NIE\n");
			return;
		}
	}
	tak++;
	printf("TAK\n");
	return;
}

int32_t main()
{
	//ios_base::sync_with_stdio(0);
	//cin.tie(NULL);
	int t;
	scanf("%lld", &t);
	while (t--)
	{
		solve();
	}
	debug(lol, tak, nie);
}