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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
// {{{
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define VARGS_(_4, _3, _2, _1, N, ...) N
#define VARGS(...) VARGS_(__VA_ARGS__, 4, 3, 2, 1)
#define CONCAT_(a, b) a##b
#define CONCAT(a, b) CONCAT_(a, b)
#define FOR_1(x) for (auto& x)
#define FOR_2(i, n) for (auto i = remove_reference_t<decltype(n)>{0}; i < (n); ++i)
#define FOR_3(i, b, e) for (auto i = remove_reference_t<decltype(e)>{b}; i < (e); ++i)
#define FOR_4(i, b, e, s) for (auto i = remove_reference_t<decltype(e)>{b}; i < (e); i += s)
#define FORD_2(i, n) for (auto i = (n) - 1; i >= 0; --i)
#define FORD_3(i, b, e) for (auto i = remove_reference_t<decltype(b)>{(e) - 1}; i >= (b); --i)
#define FORD_4(i, b, e, s) for (auto i = remove_reference_t<decltype(b)>{(e) - 1}; i >= (b); i -= s)
#define FOR(...) CONCAT(FOR_, VARGS(__VA_ARGS__))(__VA_ARGS__)
#define FORD(...) CONCAT(FORD_, VARGS(__VA_ARGS__))(__VA_ARGS__)
#define B begin()
#define E end()
#define RB rbegin()
#define RE rend()
#define A(x) std::begin(x), std::end(x)
#define RA(x) std::rbegin(x), std::rend(x)
#define RANGE(x, b, e) (std::begin(x) + (b)), (std::begin(x) + (e))
#define MP make_pair
#define MT make_tuple
#define FS first
#define ND second
#define G1 get<0>
#define G2 get<1>
#define G3 get<2>
#define G4 get<3>
#define G5 get<4>
#define PB push_back
#define PP pop_back
#define PF push_front
#define FF pop_front
#define RS resize
#define INF(T) numeric_limits<T>::max()
#define L0(_expr) [&]() { return _expr; }
#define L1(_expr) [&](auto&& _1) { return _expr; }
#define L2(_expr) [&](auto&& _1, auto&& _2) { return _expr; }
#define _ CONCAT(_unused_, __COUNTER__)
#define MIN min_element
#define MAX max_element
#define SUM accumulate

using namespace std;

using LL = long long; using LD = long double; using ULL = unsigned long long;
template<class T1,class T2> using P = pair<T1,T2>;
using PII = P<int,int>; using PLL = P<LL,LL>; using PLD = P<LD,LD>;
template<class T> using V = vector<T>;
using VI = V<int>; using VLL = V<LL>; using VLD = V<LD>; using VB = V<bool>; using VS = V<string>;
template<class T,class Comp=greater<T>> using PQ = priority_queue<T,V<T>,Comp>;

template<class T> int sz(const T& x) { return size(x); }
template<class T> bool amin(T& a, const T& b) { if (b < a) { a = b; return true; } return false; }
template<class T> bool amax(T& a, const T& b) { if (b > a) { a = b; return true; } return false; }
/* find_by_order(k) - k'th largest counting from 0;
   order_of_key(k) - number of items strictly smaller than k;
   join(other), split(k, other) - all keys in other greater than in *(this). */
template<class K,class V,class Comp=less<K>> using ordered_map = __gnu_pbds::tree<K,V,Comp,
      __gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<class T,class Comp=less<T>> using ordered_set = ordered_map<T,__gnu_pbds::null_type,Comp>;

string _sep = " ", _ignore; bool _newline = true; stack<ostream*> _ostack; stack<istream*> _istack;
template<class TH> void out(const TH& h) { if (_newline) _newline = false; else *_ostack.top() << _sep; *_ostack.top() << h; }
template<class TH,class...TA> void out(const TH& h, const TA&... a) { out(h); out(a...); }
void outln() { *_ostack.top() << '\n'; _newline = true; }
template<class...TA> void outln(const TA&... a) { out(a...); outln(); }
template<class TH> void in(TH& h) { *_istack.top() >> h; }
template<class TH,class...TA> void in(TH& h, TA&... a) { in(h); in(a...); }
template<class...TA> void EXIT(const TA&... a) { outln(a...); exit(0); }
#ifdef SPONGE
template<class...TA> void dbg(const TA&... a)
{ _ostack.push(&cerr); cerr << "\033[1;33m"; outln(a...); cerr << "\033[0m"; _ostack.pop(); }
#else
#define dbg(...)
#endif
struct _upgrade_io { _upgrade_io(bool ok) { _ostack.push(&cout); _istack.push(&cin);
  if (ok) { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(15); cout.setf(ios::fixed, ios::floatfield); }}
} _upgrade_io(true);
/* bitset: _Find_first(), _Find_next(i) */
// }}}

struct Ratio { // p / q
  LL p, q;

  Ratio(): p{0}, q{1} {}

  Ratio(LL a, LL b): p{a}, q{b} { normalize(); }

  Ratio(LL a): p{a}, q{1} {}

  void normalize()
  {
    if (q < 0) {
      q *= -1;
      p *= -1;
    }

    if (q > INF(LL) / 10) p = 0;

    if (p == 0) q = 1;
    else {
      LL d = gcd(abs(p), q);
      p /= d;
      q /= d;
    }
  }

  Ratio operator+(Ratio const& o) const {
    LL d = gcd(q, o.q);
    return Ratio(p * (o.q / d) + o.p * (q / d), (o.q / d) * q);
  }
  Ratio operator-(Ratio const& o) const {
    LL d = gcd(q, o.q);
    return Ratio(p * (o.q / d) - o.p * (q / d), (o.q / d) * q);
  }
  Ratio operator*(Ratio const& o) const {
    return Ratio(p * o.p, q * o.q);
  }
  Ratio operator/(Ratio const& o) const {
    return Ratio(p * o.q, q * o.p);
  }
  Ratio operator-() const {
    return Ratio(-p, q);
  }

  Ratio operator+=(Ratio const& o)  {
    (*this) = (*this) + o;
    return *this;
  }
  Ratio operator-=(Ratio const& o) {
    (*this) = (*this) - o;
    return *this;
  }
  Ratio operator*=(Ratio const& o) {
    (*this) = (*this) * o;
    return *this;
  }
  Ratio operator/=(Ratio const& o)  {
    (*this) = (*this) / o;
    return *this;
  }

  bool operator<(Ratio const& o) const {
    return (o - (*this)).p > 0;
  }

  bool operator==(Ratio const& o) const {
    return (o - (*this)).p == 0;
  }

  friend ostream& operator<<(ostream &os, Ratio const& r) {
    os << r.p << '/' << r.q;
    return os;
  }
};

using namespace rel_ops;

using T = Ratio;

int t, n;
V<P<T,T>> a, b;

int main()
{
  in(t);
  FOR(_, t) {
    in(n);
    a.RS(n);
    b.RS(n);
    FOR(i, n) {
      int l, x, y;
      in(l, x, y);
      a[i] = MP(T(x), T(l));
      b[i] = MP(T(y), T(l));
    }
    sort(A(a));
    sort(A(b));

    int i = 0, lo = 0, hi = 1;
    while (i < n) {
      dbg("-----------");
      dbg(i, lo, hi);
      dbg("Current");
      //FOR(j, n) dbg(a[j].FS, a[j].ND);
      dbg("Desired");
      //FOR(j, n) dbg(b[j].FS, b[j].ND);

      if (hi == n) {
        while (lo < n && i < n && a[lo].ND > T(0)) {
          if (a[lo].FS == b[i].FS) {
            T mix_v = min({a[lo].ND, b[i].ND});
            a[lo].ND -= mix_v;
            b[i].ND -= mix_v;
            if (b[i].ND == T(0)) i++;
          }
          else goto ans_no;
        }
        if (i == n) break; else goto ans_no;
      }

      if (hi == n || b[i].FS < a[lo].FS) goto ans_no;
      else if (a[hi].ND == T(0)) hi++;
      else if (a[lo].ND == T(0)) lo = hi++;
      else if (b[i].FS <= a[hi].FS) {
        T p = (b[i].FS - a[hi].FS) / (a[lo].FS - a[hi].FS);

        if (p == T(0)) {
          T mix_v = min(a[hi].ND, b[i].ND);
          a[hi].ND -= mix_v;
          b[i].ND -= mix_v;
        }
        else if (p == T(1)) {
          T mix_v = min(a[lo].ND, b[i].ND);
          a[lo].ND -= mix_v;
          b[i].ND -= mix_v;
        }
        else {
          T mix_v = min({a[lo].ND / p, a[hi].ND / (T(1) - p), b[i].ND});
          dbg("mix_v",mix_v, "prop", p);
          b[i].ND -= mix_v;
          a[lo].ND -= p * mix_v;
          a[hi].ND -= (T(1) - p) * mix_v;
        }
        if (b[i].ND == T(0)) i++;
      }
      else {
        T v = a[lo].ND + a[hi].ND;
        T h = (a[lo].FS * a[lo].ND + a[hi].FS * a[hi].ND) / v;
        a[lo].ND = T(0);
        a[hi] = MP(h, v);
        lo = hi++;
      }
    }

    dbg("-----------");
    dbg(i, lo, hi);
    dbg("Current");
    FOR(j, n) dbg(a[j].FS, a[j].ND);
    dbg("Desired");
    FOR(j, n) dbg(b[j].FS, b[j].ND);
    outln("TAK");
    continue;
ans_no:
    outln("NIE");
  }
}