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

const int MAXN = 5e5+7;
const int duzo = 1e9+7;
int n,k;
int t[MAXN];
int maxsuf[MAXN];
int minpref[MAXN];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    for (int i = 1; i <= n; i++){
        cin>>t[i];
    }
    if (k >= 4){
        vector<int>w;
        for (int i = 2; i <= n; i++){
            if (t[i] <= t[i-1]){
                w.push_back(i);
                w.push_back(i-1);
                if (i != 2){
                    w.push_back(i-2);
                }
                break;
            }
        }
        if (w.empty()){
            cout<<"NIE\n";
            return 0;
        }
        int wsize = w.size();
        bool b;
        for (int i = 1; w.size() < k-1; i++){
            b = 0;
            for (int j = 0; j < wsize; j++){
                if (w[j] == i){
                    b = 1;
                    break;
                }
            }
            if (!b){
                w.push_back(i);
            }
        }
        sort(w.begin(), w.end());
        cout<<"TAK\n";
        for (auto i : w){
            cout<<i<<" ";
        }
        cout<<"\n";
        return 0;
    }
    if (k == 2){
        maxsuf[n] = t[n];
        for (int i = n-1; i > 0; i--){
            maxsuf[i] = max(maxsuf[i+1], t[i]);
        }
        int curmin = duzo;
        for (int i = 1; i < n; i++){
            curmin = min(curmin, t[i]);
            if (curmin >= maxsuf[i+1]){
                cout<<"TAK\n";
                cout<<i<<"\n";
                return 0;
            }
        }
        cout<<"NIE\n";
        return 0;
    }
    if (k == 3){
        minpref[1] = t[1];
        for (int i = 2; i <= n; i++){
            minpref[i] = min(minpref[i-1], t[i]);
        }
        int indmax = 1;
        for (int i = 1; i <= n; i++){
            if (t[i] > t[indmax]){
                indmax = i;
            }
        }
        if (indmax != n){
            cout<<"TAK\n";
            if (indmax == 1){
                cout<<"1 2\n";
            }
            else{
                cout<<indmax-1<<" "<<indmax<<"\n";
            }
            return 0;
        }
        for (int i = 2; i < n; i++){
            if (t[i] <= minpref[i-1]){
                cout<<"TAK\n";
                cout<<i-1<<" "<<i<<"\n";
                return 0;
            }
        }
        cout<<"NIE\n";
        return 0;
    }
}