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
#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// debug & operator << (debug & dd, P p) { dd << "(" << p.x << ", " << p.y << ")"; return dd; }

const int INF = 1e9 + 5;

void YES(vector<int> v) {
	puts("TAK");
	for (int x : v) {
		printf("%d ", x);
	}
	puts("");
	exit(0);
}
void NO() {
	puts("NIE");
	exit(0);
}

int main() {
	int n, k;
	scanf("%d%d", &n, &k);
	// printf("%d %d\n", n, k);
	vector<int> a(n+1); // 1..n
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
		// printf("%d ", a[i]);
	}
	// puts("");
	vector<int> pref_min(n+1), suf_max(n+2);
	pref_min[0] = INF;
	for (int i = 1; i <= n; ++i) {
		pref_min[i] = min(pref_min[i-1], a[i]);
	}
	for (int i = n; i >= 1; --i) {
		suf_max[i] = max(suf_max[i+1], a[i]);
	}
	if (k == 2) {
		for (int i = 1; i <= n - 1; ++i) {
			if (pref_min[i] >= suf_max[i+1]) {
				YES({i});
			}
		}
		NO();
	}
	if (k == 3) {
		for (int i = 2; i <= n - 1; ++i) {
			if (!(pref_min[i-1] < a[i] && a[i] < suf_max[i+1])) {
				YES({i-1, i});
			}
		}
		NO();
	}
	for (int i = 1; i <= n - 1; ++i) {
		if (a[i] >= a[i+1]) {
			set<int> s{i};
			if (i + 1 != n) {
				s.insert(i+1);
			}
			if (i != 1) {
				s.insert(i-1);
			}
			for (int j = 1; j <= n - 1 && (int) s.size() < k - 1; ++j) {
				s.insert(j);
			}
			assert((int) s.size() == k - 1);
			YES(vector<int>(s.begin(), s.end()));
		}
	}
	NO();
}