#include <bits/stdc++.h>
template <typename _Tp>void read(_Tp &x) {
    char ch(getchar());
    bool f(false);

    while (!isdigit(ch))
        f |= ch == 45, ch = getchar();

    x = ch & 15, ch = getchar();

    while (isdigit(ch))
        x = x * 10 + (ch & 15), ch = getchar();

    if (f)
        x = -x;
}
template <typename _Tp, typename... Args>void read(_Tp &t, Args &...args) {
    read(t);
    read(args...);
}
const int N = 100005;
struct node {
    int l, x;
    inline bool operator < (const node &o)const {
        return x < o.x;
    }
} a[N], b[N];
void MAIN() {
    int n;
    read(n);

    for (int i = 1, l, x, y; i <= n; ++i)
        read(l, x, y), a[i] = {l, x}, b[i] = {l, y};
    std::sort(a + 1, a + n + 1), std::sort(b + 1, b + n + 1);
    int p1 = 1, p2 = 1;
    long long cur = 0;

    while (p1 <= n || p2 <= n) {
        int tmp = std::min(a[p1].l, b[p2].l);
        a[p1].l -= tmp, b[p2].l -= tmp;
        cur += 1LL * tmp * (a[p1].x - b[p2].x);

        if (cur > 0)
            return puts("NIE"), void();

        p1 += a[p1].l == 0, p2 += b[p2].l == 0;
    }

    puts(cur == 0 ? "TAK" : "NIE");
}
int main() {
    int _;
    read(_);

    while (_--)
        MAIN();

    return 0;
}