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
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// gp_hash_table<int, int> mapka;

using namespace std;
#define PB push_back
#define MP make_pair
#define LL long long
#define int LL
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define RE(i,n) FOR(i,1,n)
#define REP(i,n) FOR(i,0,(int)(n)-1)
#define R(i,n) REP(i,n)
#define VI vector<int>
#define PII pair<int,int>
#define LD long double
#define FI first
#define SE second
#define st FI
#define nd SE
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())

template<class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){ cerr<<sdbg<<'='<<h<<endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
  while(*sdbg!=',')cerr<<*sdbg++;
  cerr<<'='<<h<<','; _dbg(sdbg+1, a...);
}

template<class T> ostream &operator<<(ostream& os, vector<T> V) {
  os << "["; for (auto vv : V) os << vv << ","; return os << "]";
}
template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
  return os << "(" << P.st << "," << P.nd << ")";
}

#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

const int inf = 1e12;
int n,k;
int32_t main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(11);
  cerr << fixed << setprecision(6);
  cin >> n >> k;
  vector<int> t(n);
  R(i,n)cin >> t[i];
  if(k == 2){
    vector<int> minpref(n + 1);
    minpref[0] = inf;
    R(i,n){
      minpref[i + 1] = min(minpref[i], t[i]);
    }
    int maxsuf = t[n-1];
    for(int i = n-1; i; i--){
      if(minpref[i] >= maxsuf){
        cout << "TAK\n" << i << "\n";
        return 0;
      }
      maxi(maxsuf, t[i-1]);
    }
  }else if(k == 3){
    int mi = inf;
    int ma = -inf;
    R(i,n){
      mini(mi,t[i]);
      maxi(ma,t[i]);
    }
    for(int i = 1; i < n-1;i++){
      if(t[i] == mi || t[i] == ma){
        cout << "TAK\n" << i << " " << i + 1 << "\n";
        return 0;
      }
    }
    if(t[0] == ma){
      cout << "TAK\n1 2\n"; 
      return 0;
    }
  }else{
    R(i,n-1){
      if(t[i] >= t[i+1]){
        set<int> res;
        if(i != 0) res.insert(i);
        res.insert(i+1);
        if(i + 2 != n) res.insert(i+2);
        for(int j = 1; j < n && SZ(res) != k-1;j++){
          res.insert(j);
        }
        cout << "TAK\n";
        assert(SZ(res) == k-1);
        for(int el:res){
          cout << el << " ";
        }
        cout << "\n";
        return 0;
      }
    }
  }
  cout << "NIE\n";
}