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
#include <bits/stdc++.h>

#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define st first
#define nd second

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__) << "] "
 
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vll = vector<ll>;

int n, k;
vi seq;

vi GetMinPref() {
	vi min_pref(n);
	min_pref[0] = seq[0];
	for (int i = 1; i < n; ++i) {
		min_pref[i] = min(min_pref[i - 1], seq[i]);
	}
	return min_pref;
}

vi GetMaxSuf() {
	vi max_suf(n);
	max_suf[n - 1] = seq[n - 1];
	for (int i = n - 2; i >= 0; --i) {
		max_suf[i] = max(max_suf[i + 1], seq[i]);
	}
	return max_suf;
}

vi Solve2() {
	const vi min_pref = GetMinPref();
	const vi max_suf = GetMaxSuf();

	for (int last_pref = 0; last_pref < n - 1; ++last_pref) {
		if (min_pref[last_pref] >= max_suf[last_pref + 1]) {
			return vi{last_pref + 1};
		}
	}
	return {};
}

vi Solve3() {
	const vi min_pref = GetMinPref();
	const vi max_suf = GetMaxSuf();
	
	for (int i = 1; i < n - 1; ++i) {
		if (seq[i] == min_pref[i] || seq[i] == max_suf[i]) {
			return vi{i, i + 1};
		}
	}
	if (seq[n - 1] == min_pref[n - 1]) {
		return vi{n - 2, n - 1};
	}
	if (seq[0] == max_suf[0]) {
		return vi{1, 2};
	}
	return {};
}

vi SolveMany() {
	int loc = -1;
	for (int i = 1; i < n; ++i) {
		if (seq[i] <= seq[i - 1]) {
			loc = i;
			break;
		}
	}
	
	if (loc == -1) {
		return {};
	}
	
	vector<bool> is_split(n);
	if (loc - 1 >= 1) { is_split[loc - 1] = true; }
	is_split[loc] = true;
	if (loc + 1 < n) { is_split[loc + 1] = true; }
	
	int rem_splits = k - count(ALL(is_split), true) - 1;
	for (int i = 1; i < n; ++i) {
		if (rem_splits && !is_split[i]) {
			is_split[i] = true;
			--rem_splits;
		}
	}
	
	vi ans;
	for (int i = 1; i < n; ++i) {
		if (is_split[i]) {
			ans.push_back(i);
		}
	}
	return ans;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(11);
	cerr << fixed << setprecision(6);
	
	cin >> n >> k;
	seq.resize(n);
	for (int &x : seq) {
		cin >> x;
	}
	
	vi res;
	if (k == 2) {
		res = Solve2();
	} else if (k == 3) {
		res = Solve3();
	} else {
		assert(k >= 4);
		res = SolveMany();
	}
	
	if (res.empty()) {
		cout << "NIE\n";
	} else {
		cout << "TAK\n";
		for (int i = 0; i < SZ(res); ++i) {
			if (i) { cout << " "; }
			cout << res[i];
		}
		cout << "\n";
	}
}