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
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define L long long
#define MP make_pair
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define ST first
#define ND second
#define S size()
#define RS resize

using VI = vector<int>;
using VVI = vector<VI>;
using PI = pair<int, int>;
using VPI = vector<PI>;
using VVPI = vector<VPI>;
using VL = vector<L>;
using VVL = vector<VL>;
using VB = vector<bool>;
using VC = vector<char>;

struct k
{
    L l, t;
};

bool operator < (k p, k q)
{
    return p.t < q.t;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    REP(f, t)
    {
        int n;
        cin >> n;
        vector<k> kub1(n), kub2(n);
        REP(i, n)
        {
            k nowy1, nowy2;
            cin >> nowy1.l >> nowy1.t >> nowy2.t;
            nowy2.l = nowy1.l;
            kub1[i] = nowy1;
            kub2[i] = nowy2;
        }
        sort(kub1.begin(), kub1.end());
        sort(kub2.begin(), kub2.end());
        L suma1 = 0, suma2 = 0;
        REP(i, n)
        {
            suma1 += kub1[i].t * kub1[i].l;
            suma2 += kub2[i].t * kub2[i].l;
        }
        if (suma1 != suma2)
        {
            cout << "NIE" << endl;
            continue;
        }
        suma1 = suma2 = 0;
        L ile1 = 0, ile2 = 0;
        int poz1 = 0;
        bool zle = false;
        REP(i, n)
        {
            ile2 += kub2[i].l;
            suma2 += kub2[i].l * kub2[i].t;
            while (ile1 + kub1[poz1].l < ile2)
            {
                ile1 += kub1[poz1].l;
                suma1 += kub1[poz1].l * kub1[poz1].t;
                poz1++;
            }
            if ((ile2 - ile1) * kub1[poz1].t + suma1 > suma2)
                zle = true;
        }
        suma1 = suma2 = ile1 = ile2 = 0;
        poz1 = n - 1;
        REPR(i, n)
        {
            ile2 += kub2[i].l;
            suma2 += kub2[i].l * kub2[i].t;
            while (ile1 + kub1[poz1].l < ile2)
            {
                ile1 += kub1[poz1].l;
                suma1 += kub1[poz1].l * kub1[poz1].t;
                poz1--;
            }
            if ((ile2 - ile1) * kub1[poz1].t + suma1 < suma2)
                zle = true;
        }
        if (zle)
            cout << "NIE" << endl;
        else
            cout << "TAK" << endl;
    }
}