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
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define REPD(i,n) FORD(i,0,n)
#define VAR(v,w) __typeof(w) v=(w)
#define FORE(it,c) for(VAR(it,(c).begin());it!=(c).end();++it)
#define PB push_back
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) ((int)(c).size())
#define MP make_pair
#define FT first
#define SD second
#define CLEAR(a) memset((a), 0, sizeof(a))
#define INT(x) int x; scanf("%d", &x)
#define LLG(x) LL x; scanf("%lld", &x)
#define STR(n,x) char x[n]; scanf("%s", x)
#define LINE(n,x) char x[n]; gets(x)

typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<VI> VVI;
typedef vector<PII> VII;
typedef vector<double> VD;
typedef vector<LD> VLD;
typedef vector<LL> VLL;
typedef vector<bool> VB;

struct Z {
	int p, k, c;
	bool operator<(const Z& z) const {
		return p < z.p;
	}
};

int t;
Z z[100];

int slack(int i) {
	return z[i].k - t - z[i].c;
}

struct Comp {
	bool operator()(int i, int j) {
		return slack(i) > slack(j);
	}
};

int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	REP(i,n) scanf("%d%d%d", &z[i].p, &z[i].k, &z[i].c);
	sort(z, z + n);
	int j = 0;
	priority_queue<int, VI, Comp> q;
	REP(tt,1000000) {
		t = tt;
		while (j < n && z[j].p == t) q.push(j++);
		VI run;
		REP(x,m) {
			if (q.empty()) break;
			if (slack(q.top()) < 0) {
				printf("NIE\n");
				return 0;
			}
			run.PB(q.top());
			q.pop();
		}
		FORE(it,run) if (--z[*it].c) q.push(*it);
	}
	t = 1000000;
	while (!q.empty()) {
		if (slack(q.top()) < 0) {
			printf("NIE\n");
			return 0;
		}
		q.pop();
	}
	printf("TAK\n");
}