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

#define each(...)    for (auto& __VA_ARGS__)
#define rep(i, b, e) for (int i = (b); i <= (e); i++)
#define rev(i, b, e) for (int i = (e); i >= (b); i--)
#define mp make_pair
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#ifdef SPONGE
#define dbg(f, ...) fprintf(stderr, "\033[1;33m" f "\033[0m", ##__VA_ARGS__)
#else
#define dbg(...) 1
#endif
#define tC template<class

using namespace std;

tC T> using V = vector<T>;
tC T1, class T2> using P = pair<T1,T2>;
tC T, class C=greater<T>> using PQ = priority_queue<T,V<T>,C>;

using ll = long long;
using ld = long double;
using ul = unsigned long long;
using pii = P<int,int>;
using pll = P<ll,ll>;
using pld = P<ld,ld>;
using vi = V<int>;
using vll = V<ll>;
using vld = V<ld>;
using vb = V<bool>;
using vs = V<string>;
using vpii = V<pii>;
using vpll = V<pll>;
using vpld = V<pld>;

tC T> int sz(const T& a) { return (int)a.size(); }
tC T> bool amin(T& a, T b) { return b < a ? a = b, 1 : 0; }
tC T> bool amax(T& a, T b) { return b > a ? a = b, 1 : 0; }

const size_t rseed = 4488;
// chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(rseed);
tC T> T rand(T lo, T hi) { return uniform_int_distribution<T>{lo,hi}(rnd); }

const int oo = 1e9 + 1;
const ll OO = 1e18 + 1;

namespace { void solve(); }
// }}}

int main()
{
  int t = 1;
  // scanf("%d", &t);
  rep(i, 1, t) {
    // printf("Case #%d: ", i);
    solve();
  }
}

namespace {

const int N = 5e5 + 50;
int n, k, a[N];
int pref[N], suff[N];

bool dasie = false;
vi rozw;

void solve()
{
  scanf("%d %d", &n, &k);

  rep(i, 1, n) {
    scanf("%d", &a[i]);
  }

  pref[0] = oo;
  rep(i, 1, n) {
    pref[i] = min(pref[i - 1], a[i]);
  }

  suff[n + 1] = 0;
  rev(i, 1, n) {
    suff[i] = max(suff[i + 1], a[i]);
  }

  int mini = pref[n];
  int maxi = suff[1];

  if (k == 2) {
    rep(i, 2, n) {
      if (pref[i - 1] >= suff[i]) {
        dasie = true;
        rozw.pb(i - 1);
        break;
      }
    }
  }
  else if (k == 3) {
    if (a[1] == maxi) {
      dasie = true;
      rozw.pb(1);
      rozw.pb(2);
    }
    else if (a[n] == mini) {
      dasie = true;
      rozw.pb(1);
      rozw.pb(n - 1);
    }
    else {
      rep(i, 2, n - 1) {
        if (a[i] == mini || a[i] == maxi) {
          dasie = true;
          rozw.pb(i - 1);
          rozw.pb(i);
          break;
        }
      }
    }
  }
  else {
    rep(i, 2, n) {
      if (a[i - 1] >= a[i]) {
        dasie = true;
        if (i >= 3) rozw.pb(i - 2);
        rozw.pb(i - 1);
        if (i < n) rozw.pb(i);
        rep(j, 1, n - 1) {
          if (sz(rozw) < k - 1 && (j < i - 2 || j > i)) {
            rozw.pb(j);
          }
        }
        sort(all(rozw));
        break;
      }
    }
  }

  if (dasie) {
    // assert(sz(rozw) == k - 1);
    printf("TAK\n");
    each(x : rozw) printf("%d ", x);
    printf("\n");
  }
  else {
    printf("NIE\n");
  }
}

}