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

using namespace std;

const int MAXN = 5e5 + 7;

int tab[MAXN];

int main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
		
	int n, k;
	cin >> n >> k;
		
	for(int i = 1; i <= n; i++){
			
		cin >> tab[i];
	}

			
	int maks = 0, ind = -1;
			
	for(int i = 1; i <= n; i++){
				
		if(tab[i] > maks){
					
			maks = tab[i];
			ind = i;		
		}
	}
			
	if(ind == n) cout << "NIE" << '\n';
	else {
				
		cout << "TAK" << '\n';
					
		vector<int> v;
		v.push_back(ind);
				
		int x = ind - 1;
		int left = k - 2;
		
		while(x > 0 && left > 0){
			
			v.push_back(x);
			left--; x--;
		}		
				
		x = ind + 1;
				
		while(x <= n && left > 0){
			
			v.push_back(x);
			left--; x--;
		}		
				
		sort(v.begin(), v.end());	
				
		for(auto u : v) cout << u << ' ';
		cout << '\n';	
	}
	
	return 0;
}