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
#include<cstdio>
#include<algorithm>
#include<utility>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<iostream>

// macros

#define FORE(c, a, b) for(int c=a; c<= int(b); ++c)
#define FORD(c, a, b) for(int c=a; c>= int(b); --c)
#define FORIT(it, cont, cont_t) for(cont_t::iterator it = cont.begin(); it != cont.end(); ++it)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define ALL(a) a.begin(), a.end() 
#define PR(n) printf("%d ", (int) (n)) 
#define PRL(n) printf("%lld ", (ll) (n)) 
#define SC(n) scanf("%d", &n);
#define SC2(n, m) scanf("%d%d", &n, &m);

#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define itr iterator

#define dbg if(1)
#define prd dbg printf

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int uint;

typedef vector<int> vi;
typedef set<int> si;
typedef map<int, int> mi;
typedef pair<int, int> pi;
typedef vector<pi> vii;
typedef vector<vi> vvi;

const int NMAX = 1<<10;

int n, m, ans = 1;
int p[NMAX], k[NMAX], c[NMAX];
vi ev;

int main() {
  SC2(n,m);
  REP(i,n) {
    SC2(p[i], k[i]); SC(c[i]);
    ev.pb(p[i]); ev.pb(k[i]);
  }
  sort(ALL(ev));
  
  REP(j2, 2*n) {
    REP(j1, j2) {
      int x = ev[j1], y = ev[j2], load = 0;
      REP(i, n) {
        int cc = c[i];
        if(p[i] < x) cc -= x - p[i];
        if(k[i] > y) cc -= k[i] - y;
        if(cc > 0) load += cc;
      }
      if(load > (y - x) * m) {
        printf("NIE"); return 0;
      }
    }
  }
  printf("TAK"); return 0;
}