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
#include <iostream>
#include <set>
#include <vector>

int read_int() {
  int x;
  std::cin >> x;
  return x;
}

std::vector<int> read_vec(int n) {
  std::vector<int> v(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> v[i];
  }
  return v;
}

int min(const std::multiset<int> &s) { return *(s.begin()); }

int max(const std::multiset<int> &s) { return *(std::prev(s.end())); }

void process2(const std::vector<int> &V) {
  std::multiset<int> a;
  std::multiset<int> b;

  a.insert(V[0]);

  for (size_t i = 1; i < V.size(); ++i) {
    b.insert(V[i]);
  }

  //////////////////////

  if (min(a) > max(b)) {
    std::cout << "TAK" << std::endl;
    std::cout << "1" << std::endl;
    return;
  }

  for (size_t i = 1; i < V.size() - 1; ++i) {
    a.insert(V[i]);
    b.erase(b.find(V[i]));

    if (min(a) >= max(b)) {
      std::cout << "TAK" << std::endl;
      std::cout << i + 1 << std::endl;
      return;
    }
  }

  std::cout << "NIE" << std::endl;
}

void process3(const std::vector<int> &V) {
  std::multiset<int> a;
  std::multiset<int> b;
  int p = 0;

  a.insert(V[0]);
  p = V[1];

  for (size_t i = 2; i < V.size(); ++i) {
    b.insert(V[i]);
  }

  //////////////////////

  if (min(a) >= p || p >= max(b)) {
    std::cout << "TAK" << std::endl;
    std::cout << "1 2" << std::endl;
    return;
  }

  for (size_t i = 2; i < V.size() - 1; ++i) {
    a.insert(V[i - 1]);
    p = V[i];
    b.erase(b.find(V[i]));

    if (min(a) >= p || p >= max(b)) {
      std::cout << "TAK" << std::endl;
      std::cout << i << " " << i + 1 << std::endl;
      return;
    }
  }

  std::cout << "NIE" << std::endl;
}

void process4(const std::vector<int> &V, const int N, const int K) {
  for (size_t i = 0; i < V.size() - 1; ++i) {
    if (V[i] >= V[i + 1]) {
      std::set<int> s;

      s.insert(i + 1);
      if (i + 2 < (size_t) N) {
        s.insert(i + 2);
      }
      if (i > 0) {
        s.insert(i);
      }

      int index = 1;
      while ((int) s.size() < K - 1) {
        s.insert(index);
        index++;
      }

      std::cout << "TAK" << std::endl;
      for (const auto &i : s) {
        std::cout << i << " ";
      }
      std::cout << std::endl;
      return;
    }
  }
  std::cout << "NIE" << std::endl;
}

int main() {
  std::ios::sync_with_stdio(false);

  const int N = read_int();
  const int K = read_int();

  const std::vector<int> V = read_vec(N);

  if (K == 2) {
    process2(V);
  } else if (K == 3) {
    process3(V);
  } else {
    process4(V, N, K);
  }

  return 0;
}