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
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <tuple>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;







int main() {
	/*ifstream cin("input.txt");
	ofstream cout("output.txt");*/
	int n, m;
	cin >> m >> n;
	vector <int> left(m);
	vector <int> put(m);
	vector <int> xz(m,0);
	vector <pair <int, int> > tasks(m);
	vector <pair <int, pair <int,int> > > x(m);
	set <pair <int, int> > q;
	set <int> times;
	for (int i = 0; i < m; i++)
	{
		cin >> x[i].first >> x[i].second.first >> x[i].second.second;
		times.insert(x[i].first);
		times.insert(x[i].second.first);
		times.insert(x[i].second.first - x[i].second.second);
	}
	sort(x.begin(), x.end());
	for (int i = 0; i < m; i++)
	{
		left[i] = x[i].second.second;
		tasks[i].first = x[i].first;
		tasks[i].second = x[i].second.first;
	}
	times.insert(1e7);
	while (!times.empty())
	{
		set <pair <int, int> > ids;
		int z = *times.begin();
		if (z >= 1e7)
			n = 1000;
		times.erase(times.begin());
		for (int i = 0; i < m; i++)
		{
			if (xz[i]>0)
				left[i] -= (z - put[i]);
			if (tasks[i].first <= z && left[i]>0)
				ids.insert(make_pair((tasks[i].second - left[i]) - z, i));
			xz[i] = 0;
		}
		int r = min(n, (int)ids.size());
		for (int i = 0; i < r; i++)
		{
			pair <int, int> w = *ids.begin();
			if (w.first < 0)
			{
				cout << "NIE" << endl;
				return 0;
			}
			ids.erase(ids.begin());
			put[w.second] = z;
			xz[w.second] = 1;
			times.insert(z + left[w.second]);
		}

		
	}
	
	cout << "TAK" << endl;


}