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
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(c) (c).begin(), (c).end()
#define sz(X) (int)((X).size())
typedef long double ld;
typedef unsigned long long ull;
typedef long long ll;
#ifdef LOCAL
ostream &operator<<(ostream &out, string str) {
   for (char c : str)
      out << c;
   return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; }
template <class L, class R, class S> ostream &operator<<(ostream &out, tuple<L, R, S> p) {
   auto &[a, b, c] = p;
   return out << "(" << a << ", " << b << ", " << c << ")";
}
template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
   out << '{';
   for (auto it = a.begin(); it != a.end(); it = next(it))
      out << (it != a.begin() ? ", " : "") << *it;
   return out << '}';
}
void dump() { cerr << "\n"; }
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) 42
#endif

namespace SOLVE {

   vector<int> solve2(vector<int> X, int k) {
      int n = sz(X);

      auto Maks = X;
      auto Min = X;
      partial_sum(all(Min), Min.begin(), [&](auto a, auto b) { return min(a, b); });
      partial_sum(Maks.rbegin(), Maks.rend(), Maks.rbegin(), [&](auto a, auto b) { return max(a, b); });

      for (int i = 0; i < n - 1; i++) {
         if (Min[i] >= Maks[i + 1])
            return {i};
      }
      return {};
   }
   vector<int> solve3(vector<int> X, int k) {
      int n = sz(X);

      int mini = *min_element(all(X));
      int maksi = *max_element(all(X));

      rep(i, n) if ((X[i] == mini && i) || (X[i] == maksi && i != n - 1)) {
         if (i == 0)
            return {i, i + 1};
         return {i - 1, i};
      }
      return {};
   }

   vector<int> solve(vector<int> X, int k) {
      int n = sz(X);
      if (k == 2)
         return solve2(X, k);
      if (k == 3)
         return solve3(X, k);

      set<int> res;
      rep(i, n - 1) if (X[i] >= X[i + 1]) {
         res.insert(i);
         if (i != n - 2)
            res.insert(i + 1);
         if (i != 0)
            res.insert(i - 1);
         debug(i);
         break;
      }
      if (sz(res)) {
         int i = 0;
         while (sz(res) != k - 1)
            res.insert(i++);
      }
      return vector<int>(all(res));
   }
} // namespace SOLVE

int32_t main() {
   _upgrade;

   int n = 5e5, k = 3;
   cin >> n >> k;

   vector<int> X(n);
   for (auto &x : X)
      cin >> x;
   auto res = SOLVE::solve(X, k);
   if (sz(res)) {
      cout << "TAK\n";
      for (int x : res)
         cout << x + 1 << " ";
      cout << endl;
   } else {
      cout << "NIE\n";
   }
}