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

#define int int64_t
#define pb push_back
#define st first
#define nd second
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

int32_t main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, k;
	cin >> n >> k;
	vector<int> v(n);
	for(int i=0;i<n;i++) cin >> v[i];
	if(k == 2) {
		vector<int> Max(n);
		Max[n-1] = v[n-1];
		for(int i=n-2;i>=0;i--) Max[i] = max(Max[i+1], v[i]);
		int Min = 1e9;
		for(int i=0;i<n-1;i++) {
			Min = min(Min, v[i]);
			if(Min >= Max[i+1]) {
				cout << "TAK\n";
				cout << i+1 << "\n";
				return 0;
			}
		}
		cout << "NIE\n";
		return 0;
	}
	if(k == 3) {
		int Max = *max_element(all(v));
		int Min = *min_element(all(v));
		for(int i=0;i<n-1;i++) {
			if(v[i] == Max) {
				cout << "TAK\n";
				cout << i << " " << i+1 << "\n";
				return 0;
			}
		}
		for(int i=1;i<n;i++) {
			if(v[i] == Min) {
				cout << "TAK\n";
				cout << i << " " << i+1 << "\n";
				return 0;
			}
		}
		cout << "NIE\n";
		return 0;
	}
	for(int i=0;i<n-1;i++) {
		if(v[i] >= v[i+1]) {
			cout << "TAK\n";
			int rem = k-4;
			for(int j=0;j<i-1&&rem;j++) {
				cout << j+1 << " ";
				rem--;
			}
			cout << i << " " << i+1 << " " << i+2 << " ";
			for(int j=i+2;j<n&&rem;j++) {
				cout << j+1 << " ";
				rem--;
			}
			cout << "\n";
			return 0;
		}
	}
	cout << "NIE\n";
}