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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <bits/stdc++.h>

using namespace std;

int a[500500];
int mns[500500];
int mxs[500500];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, k;
    cin >> n >> k;

    for(int i = 0; i < n; i++) {
        cin >> a[i];
        mns[i] = 2000000000;
        mxs[i] = -2000000000;
    }

    bool t = true;
    int x;
    for(int i = 1; t && i < n; i++) {
        if(a[i] <= a[i - 1]) {
            t = false;
            x = i;
        }
    }

    if(t) {
        cout << "NIE\n";
        return 0;
    }

    if(k > 3) {
        cout << "TAK\n";

        if(x == 1) {
            for(int i = 1;  i < k; i++) {
                cout << i << " ";
            }
            cout << "\n";
            return 0;
        }

        if(x == n - 1) {
            for(int i = n - k + 1; i < n; i++) {
                cout << i << " ";
            }
            cout << "\n";
            return 0;
        }

        bool x1 = true;
        bool x2 = true;
        bool x3 = true;
        for(int i = 1; i < k - 3 && i <= n; i++) {
            cout << i << " ";
            if(i == x - 1) {
                k++;
                x1 = false;
            }
            if(i == x) {
                k++;
                x2 = false;
            }
            if(i == x + 1) {
                k++;
                x2 = false;
            }
        }
        
        if(x1) {
            cout << x - 1 << " ";
        }
        if(x2) {
            cout << x << " ";
        }
        if(x2) {
            cout << x + 1 << " ";
        }
        cout << "\n";

        return 0;
    }

    if(k > 2) {
        int mn = *min_element(a, a + n);
        int mx = *max_element(a, a + n);

        for(int i = 0; i < n; i++) {
            if((a[i] == mn && i != 0) || (a[i] == mx && i != n - 1)) {
                if(i == 0) {
                    cout << "TAK\n";
                    cout << "1 2\n";
                    return 0;
                }

                if(i == n - 1) {
                    cout << "TAK\n";
                    cout << n - 2 << " " << n - 1 << "\n";
                    return 0;
                }

                cout << "TAK\n";
                cout << i << " " << i + 1 << "\n";
                return 0;
            }
        }

        cout << "NIE\n";
        return 0;
    }

    mns[0] = a[0];
    mxs[n - 1] = a[n - 1];
    for(int i = 1; i < n; i++) {
        mns[i] = min(a[i], mns[i - 1]);
        mxs[n - 1 - i] = max(a[n - 1 - i], mxs[n - 1 - (i - 1)]);
    }

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

    cout << "NIE\n";

    return 0;
}