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

using namespace std;

// 2 <= k <= n <= 5*10^5
int n, k;
vector<int> a, prefMin, sufMax;
vector<int> result;

void solveCaseTwo() {
    int tmpMin = a[0];
    int tmpMax = a[n - 1];
    for (int i = 0; i < n; ++i) {
        tmpMin = min(tmpMin, a[i]);
        prefMin.push_back(tmpMin);

        tmpMax = max(tmpMax, a[n - 1 - i]);
        sufMax.push_back(tmpMax);
    }

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

    cout << "NIE";
}

void solveCaseThree() {
    int maxEl = *max_element(a.begin(), a.end());
    int minEl = *min_element(a.begin(), a.end());
    int firstMax = n, lastMin = -1;

    for (int i = 0; i < n; ++i) {
        if (a[i] == maxEl) {
            if (firstMax == n) {
                firstMax = i;
            }
        }
        if (a[i] == minEl) {
            lastMin = i;
        }
    }

    if (minEl < maxEl && firstMax == n - 1 && lastMin == 0) {
        cout << "NIE";
        return;
    }

    cout << "TAK\n";
    if (minEl == maxEl) {
        cout << 1 << " " << 2;
        return;
    }

    if (firstMax < n - 1) {
        cout << firstMax << " " << firstMax + 1;
        return;
    }

    cout << lastMin << " " << lastMin + 1;
}

void solveCaseFourOrMore() {
    int inv = -1;
    for (int i = 0; i < n - 1; ++i) {
        if (a[i] >= a[i + 1]) {
            inv = i;
            break;
        }
    }
    if (inv == -1) {
        cout << "NIE";
        return;
    }
    
    cout << "TAK\n";
    int startIdx = max(int(1), inv + 4 - k);
    for (int i = startIdx; i < k - 2 + startIdx; ++i) {
        cout << i << " ";
    }
    cout << k - 2 + startIdx;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        int tmp;
        cin >> tmp;
        a.push_back(tmp);
    }

    switch (k) {
        case 2:
        solveCaseTwo();
        break;
        case 3:
        solveCaseThree();
        break;
        default:
        solveCaseFourOrMore();
        break;
    }

    return 0;
}