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
#include <bits/stdc++.h>
using namespace std;

void solve2(int n, vector<int> a) {
    vector<int> minpref(n - 1), maxsuf(n - 1);
    
    minpref[0] = a[0];
    for (int i = 1; i < n - 1; i++) {
        minpref[i] = min(minpref[i - 1], a[i]);
    }
    maxsuf[n - 2] = a[n - 1];
    for (int i = n - 3; i >= 0; i--) {
        maxsuf[i] = max(maxsuf[i + 1], a[i + 1]);
    }

    for (int i = 0; i < n - 1; i++) {
        if (minpref[i] >= maxsuf[i]) {
            cout << "TAK\n" << i + 1 << endl;
            return;
        }
    }

    cout << "NIE\n";
}

void solve3(int n, vector<int> a) {
    for (int i = 1; i < n; i++) {
        if (a[i] <= a[0]) {
            cout << "TAK\n";
            if (i + 1 < n) {
                cout << i << " " << i + 1 << endl;
            }
            else {
                cout << "1 " << i << endl;
            }
            return;
        }
    }
    for (int i = 0; i < n - 1; i++) {
        if (a[i] >= a[n - 1]) {
            cout << "TAK\n";
            if (i > 0) {
                cout << i << " " << i + 1 << endl;
            }
            else {
                cout << i << " " << n - 1 << endl;
            }
            return;
        }
    }

    cout << "NIE\n";
}

void solve4(int n, int k, vector<int> a) {
    vector<int> answer(n - 1);
    bool sorted = true;

    for (int i = 0; i < n - 1; i++) {
        if (a[i] >= a[i + 1]) {
            sorted = false;

            answer[i] = true;
            k--;
            if (i - 1 >= 0) {
                answer[i - 1] = true;
                k--;
            }
            if (i + 1 < n - 1) {
                answer[i + 1] = true;
                k--;
            }
        }
    }

    if (sorted) {
        cout << "NIE\n";
    }
    else {
        cout << "TAK\n";

        for (int i = 0; i < n - 1; i++) {
            if (answer[i] || (!answer[i] && k > 1)) {
                cout << i + 1 << " ";
                k--;
            }
        }
        cout << endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false);

    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    if (k == 2) {
        solve2(n, a);
    }
    else if (k == 3) {
        solve3(n, a);
    }
    else {
        solve4(n, k, a);
    }

    return 0;
}