#include<cstdio>
#include<algorithm>
#include<vector>

#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);

using namespace std;
typedef vector<int> vi;

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;
}