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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
// scroll down until '// code starts here'
#include <bits/stdc++.h>
using namespace std;

const int inf = 1000000001;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define EACH(it, cont) for (auto &it : cont)
#define FOR(i, b, e)  for (int i = (b); i <= (e); ++i)
#define FORD(i, b, e) for (int i = (b); i >= (e); --i)
#define FORQ(x, Q) for (decltype((Q).front()) x; !(Q).empty() && (x = (Q).front(), (Q).pop(), true); )
#define ALL(c) (c).begin(), (c).end()
#define UNIQUE(v) { sort(ALL(v)); (v).resize(unique(ALL(v)) - (v).begin()); }

#define dump     fancy_dumper::DumpFirst<&std::cerr>(),
#define say      fancy_dumper::DumpFirst<&std::cout>(),
#define $dump    fancy_dumper::Dumper<&std::cerr>
#define $say     fancy_dumper::Dumper<&std::cout>
#define $(x) #x, fancy_dumper::ToggleSeparator(), (x),\
				 fancy_dumper::ToggleSeparator()

namespace fancy_dumper {

struct ToggleSeparator { };

template<ostream *Out>
struct DumpFirst { };

template<ostream *Out>
struct Dumper {
	static void *&last() {
		static void *p;
		return p;
	}
	static const char *&separator() {
		static const char *s = " ";
		return s;
	}
	static const char *&separatorNewLine() {
		static const char *s = "\n";
		return s;
	}
	static const char *&unseparator() {
		static const char *s = "=";
		return s;
	}
	Dumper() {
		last() = this;
	}
	~Dumper() {
		if (this == last()) {
			*Out << separatorNewLine();
			last() = 0;
		}
	}
	Dumper operator, (ToggleSeparator) {
		std::swap(separator(), unseparator());
		return Dumper();
	}
};

template<ostream *Out, class T>
Dumper<Out> operator,(Dumper<Out>, const T &e) {
	*Out << Dumper<Out>::separator() << e;
	return Dumper<Out>();
}

template<ostream *Out, class T>
Dumper<Out> operator, (DumpFirst<Out>, const T &e) {
	*Out << e;
	return Dumper<Out>();
}

}

template<class T, class Y>
ostream &operator<< (ostream &o, const pair<T, Y> &p) {
	return o << p.first << ' ' << p.second;
}

template<class T>
ostream &operator<< (ostream &o, const vector<T> &v) {
	bool isBegin = true;
	EACH (e, v) {
		if (!isBegin) { o << ' '; }
		isBegin = false;
		o << e;
	}
	return o;
}

template<class T>
ostream &operator<< (ostream &o, const set<T> &v) {
	bool isBegin = true;
	EACH (e, v) {
		if (!isBegin) { o << ' '; }
		isBegin = false;
		o << e;
	}
	return o;
}

template<class T>
ostream &operator,(ostream &o, const T &t) {
	return o << t;
}

struct StdinReader {
	StdinReader() { ios::sync_with_stdio(0); }
} stdinReader;
#define get stdinReader,

template<class T> StdinReader &operator, (StdinReader &sr, T &t) { cin >> t; return sr; }
template<class T> StdinReader &operator, (StdinReader &sr, vector<T> &v) { EACH (x, v) sr, x; return sr; }
template<class T, class U> StdinReader &operator, (StdinReader &sr, pair<T, U> &p) { return sr, p.first, p.second; }

template <class T, class U> bool remin(T &a, const U &b) { return b < a ? a = b, true : false; }
template <class T, class U> bool remax(T &a, const U &b) { return b > a ? a = b, true : false; }
template <class T> int size(const T &t) { return (int) t.size(); }

// code starts here

struct solver {
	using job = pair<pair<int,int>,int>;
	
	int n, m;
	vector<job> jobs;
	
	int   startTime(int i) { return jobs[i].first.first; }
	int    deadline(int i) { return jobs[i].first.second; }
	int  &remaining(int i) { return jobs[i].second; }
	int waitAllowed(int i) { return deadline(i) - remaining(i) ; }
	
	solver() {
		get n, m;
		jobs.resize(n);
		get jobs;
	}
	
	bool solve() {
		vector<int> events;
		events.reserve(2*n);
		REP (i, n) {
			events.push_back(startTime(i));
			events.push_back(deadline(i));
		}
		UNIQUE(events);
		//~ dump $(events);
		
		vector<int> in;
		in.reserve(n);
		REP (e, size(events)-1) {
			REP (i, n) {
				if (startTime(i) == events[e]) {
					in.push_back(i);
					//~ dump "pusz", $(i), $(e);
				} else if (deadline(i) == events[e]) {
					if (find(ALL(in), i) != in.end()) {
						return false;
					}
				}
			}
			//~ dump $(events[e]);
			step(events[e+1] - events[e], in);
		}
		//~ dump $(in);
		return in.empty();
	}
	
	void step(int l, vector<int> &in) {
		//~ dump $(l), $(in);
		//~ EACH (i, in) { dump $(i), $(waitAllowed(i)); }
		REP (ll, l) {
			sort(ALL(in), [this] (int i, int j) { return waitAllowed(i) < waitAllowed(j); });
			REP (mm, min(m, size(in))) {
				//~ dump $(mm), $(ll), $(in[mm]);
				--remaining(in[mm]);
			}
			//~ EACH (i, in) { dump "meantime", $(i), $(waitAllowed(i)); }
			FORD (i, size(in)-1, 0) {
				if (!remaining(in[i])) {
					//~ dump "pop", $(in[i]);
					in[i] = in.back();
					in.pop_back();
				}
			}
		}
		//~ EACH (i, in) { dump "after", $(i), $(waitAllowed(i)); }
	}
};

int main() {
	solver s;
	say s.solve() ? "TAK" : "NIE";
}