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
#include <iostream>
#include <vector>

using namespace std;

void K2(int n, vector<int>& data){
    vector<int> minI(n, data[0]);
    vector<int> maxI(n, data[n-1]);

    for(int i = 1; i < n; i++){
        if(data[i] < minI[i-1])minI[i] = data[i];
        else minI[i] = minI[i-1];
    }

    for(int i = n-2; i >=0; i--){
        if(data[i] > maxI[i+1])maxI[i] = data[i];
        else maxI[i] = maxI[i+1];
    }

    //sprawdzanie czy podzial <0,1), <1, n) dziala
    for(int i = 1; i < n; i++){
        if(minI[i-1] >= maxI[i]){
            cout<<"TAK"<<'\n';
            cout<<i;
            return;
        }
    }
    cout<<"NIE";
}

void K3(int n, vector<int>& data){
    int minn = data[0], maxx = data[n-1];
    for(int i = 1; i < n-1; i++){
        if(data[i] <= minn || data[i] >= maxx){
            cout<< "TAK"<<'\n';
            //udupianie
            cout << i << " " << i+1;
            return;
        }
    }
    cout<<"NIE";
}

void BigK(int n, int k, vector<int>& data){
    bool asc = true;
    int badBoy = -1;
    for(int i = 1; i < n; i++){
        if(data[i] <= data[i-1]){
            asc = false;
            badBoy = i;
            break;
        }
    }

    if(asc){
        cout<<"NIE";
        return;
    }

    cout<<"TAK\n";

    int j = 0;
    
    if(badBoy == 1){
        cout<<1<< " "<<2<<" ";
        k-=2;
        j = 3;
        while(k > 2){
            cout<<j<< " ";
            k--;
            j++;
        }
        cout<<j;
        return;
    }

    if(badBoy == n-1){
        j = 1;
        while(k > 3){
            cout<<j<<" ";
            k--;
            j++;
        }
        cout<<badBoy - 1<< " "<<badBoy;
        return;
    }
    
    while(k > 4 && j < badBoy - 2){
        cout<<j + 1<< " ";
        j++;
        k--;
    }

    cout<<badBoy - 1 <<" "<< badBoy<<" "<<badBoy + 1;
    if(k == 4) return;

    //zostalo przedzialow
    k-=3;
    cout<<" ";
    j = badBoy + 2;
    while(k > 2){
        cout<<j<< " ";
        j++;
        k--;
    }
    cout<<j;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,k;
    cin>>n>>k;

    vector<int> data(n);
    for(int i = 0; i < n; i++)cin>>data[i];

    if(k == 2)K2(n, data);
    else if(k == 3)K3(n, data);
    else BigK(n, k, data);

    return 0;
}