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
#include<iostream>
#include<vector>
using namespace std;

const int INF = 1e9 + 7;

int main() {

  int n, k;
  scanf("%d%d", &n, &k);

  int a, maxim = 0, indexMin, indexMax;
  int minim = INF;

  for(int i = 0; i < n; i++) {
    scanf("%d", &a);
    if(a <= minim) {
      minim = a;
      indexMin = i;
    }
    if(a >= maxim) {
      maxim = a;

      indexMax = i;
    }

  }

  if(indexMax == n-1) {

    printf("NIE\n");

  } else if(k == 2) {

    if(indexMin > indexMax) {
      printf("TAK\n");
      printf("%d", indexMax + 1);
    } else {
      printf("NIE\n");
    }



  } else if(indexMax < k-1) {

    printf("TAK\n");
    for(int i = 1; i <= k-1; i++) {
        printf("%d ", i);
    }



  } else {

    printf("TAK\n");
    for(int i = 1; i <= k-3; i++) {
        printf("%d ", i);
    }

    printf("%d %d", indexMax, indexMax +1);


  }







  return 0;
}