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
#include <bits/stdc++.h>
 
using namespace std;
 
#define endl '\n'
#define L long long
#define MP make_pair
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define ST first
#define ND second
#define S size
#define RS resize
 
template<class T> using P = pair<T, T>;
template<class T> using V = vector<T>;

int n, k;
V<int> a, pref, suf;

void solve_2() {
    REP(i, n - 1) {
        if (pref[i] >= suf[i + 1]) {
            cout << "TAK\n" << i + 1;
            return;
        }
    }

    cout << "NIE\n";
}

void solve_3() {
    FOR(i, 1, n - 1) {
        if (pref[i - 1] >= a[i] || suf[i + 1] <= a[i]) {
            cout << "TAK\n" << i << ' ' << i + 1;
            return;
        }
    }

    cout << "NIE\n";
}

void solve_4() {
    FOR(i, 1, n) {
        if (a[i - 1] >= a[i]) {
            int l = k - 3 - (i > 1);
            cout << "TAK\n";
            int p = 0;
            while (l > 0 && p < i - 2) {
                cout << p + 1 << ' ';
                p++;
                l--;
            }
            if (i > 1) {
                cout << i - 1 << ' ';
            }
            cout << i << ' ' << i + 1 << ' ';
            p = i + 1;
            while (l > 0) {
                cout << p + 1 << ' ';
                p++;
                l--;
            }
            return;
        }
    }

    cout << "NIE\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    cin >> n >> k;
    a.RS(n);
    pref.RS(n);
    suf.RS(n);
    REP(i, n) {
        cin >> a[i];
    }

    pref[0] = a[0];
    suf[n - 1] = a[n - 1];
    REP(i, n - 1) {
        pref[i + 1] = min(pref[i], a[i + 1]);
    }
    REPR(i, n - 1) {
        suf[i] = max(suf[i + 1], a[i]);
    }

    if (k == 2) {
        solve_2();
    }
    else if (k == 3) {
        solve_3();
    }
    else {
        solve_4();
    }
}

// g++ -std=c++17 -Wall -Wextra -Wshadow -Wconversion -D_GLIBCXX_DEBUG pod2.cpp -o pod2