#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<pii, ll> tri;
typedef pair<pii, pii> quadro;
vector<pii> herb;
bool check() {
ll balance = 0;
for(ll i=0; i<herb.size(); i++) {
balance -= herb[i].second;
//cout << balance << " ";
if(balance < 0) {
return false;
}
}
//cout << "\n";
if(balance != 0) {
return false;
}
else {
return true;
}
}
int main() {
ios_base::sync_with_stdio(0);
ll testy;
cin >> testy;
while(testy--) {
//cout << "\n";
herb.clear();
ll n;
cin >> n;
for(ll i=0; i<n; i++) {
ll l, a, b;
cin >> l >> a >> b;
herb.push_back(pii(min(a, b), -((b-a) * l)));
}
sort(herb.begin(), herb.end());
if(check()) {
cout << "TAK\n";
}
else {
cout << "NIE\n";
}
}
return 0;
}