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

typedef long long int LL;
typedef long double LD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

const int INF = 1000000001;
const LD EPS = 10e-9;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define abs(a) ((a)<0 ? -(a) : (a))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

const int MAX_K = 1000005;
const int MAX_N = 100;

struct Task
{
	int p, k, c;	
}tasks[MAX_N];

int n, m, maxTime;
bool busyProcessors[MAX_N][MAX_K];
bool solutionFound; 

int findFreeProcessor(int time)
{
	for(int i = 0; i < m; ++i)
	{
		if(!busyProcessors[i][time])
		{
			return i;	
		}
	}
	
	return -1;
}

void findSolution(int task, int taskFragment, int minTime)
{
	//cout << "task: " << task << ", taskFragment: " << taskFragment << ", minTime: " << minTime << endl;
	
	if(minTime > maxTime)
	{
		return;
	}
	
	if(taskFragment == tasks[task].c)
	{
		if(task == n-1)
		{
			solutionFound = true;	
		}
		else
		{
			findSolution(task+1, 0, tasks[task+1].p);
		}
		
		return;	
	}
	
	int maxPossibleStartTime = tasks[task].k - (tasks[task].c-taskFragment) + 1;
	
	if(maxPossibleStartTime < minTime)
	{
		return;
	}
	
	for(int i = minTime; i <= maxPossibleStartTime; ++i)
	{
		int freeProcessor = findFreeProcessor(i);
		
		if(freeProcessor != -1)
		{
			busyProcessors[freeProcessor][i] = true;			
			findSolution(task, taskFragment+1, i+1);			
			busyProcessors[freeProcessor][i] = false;
		}	
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	
	cin >> n >> m;
	for(int i = 0; i < n; ++i)
	{
		cin >> tasks[i].p >> tasks[i].k >> tasks[i].c;
		
		if(tasks[i].k > maxTime)
		{
			maxTime = tasks[i].k;
		}
	}
	
	if(m >= n)
	{
		cout << "TAK" << endl;
		return 0;
	}
	
	findSolution(0, 0, tasks[0].p);
	
	if(solutionFound)
	{
		cout << "TAK" << endl;
	}
	else
	{
		cout << "NIE" << endl;
	}
	return 0;
}