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>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long
#define mt make_tuple
    
using namespace std;

const int nax = 5e5 + 5;
int a[nax];
int n, k;
int minpref[nax];
int maxsuf[nax];

bool brane[nax];
void dokoncz(){
    int jest = 0;
    for(int i=1;i<=n;i++){
        if(brane[i]) jest++;
    }
    for(int i=1;i<=n;i++){
        if(!brane[i] && jest < k){
            brane[i] = true;
            jest++;
        }
    }

    cout << "TAK" << "\n";
    for(int i=1;i<n;i++){
        if(brane[i]) cout << i << " ";
    }
    cout << "\n";
    exit(0);
}

void nie(){
    cout << "NIE" << "\n";
    exit(0);
}

void solve(){
    cin >> n >> k;
    for(int i=1;i<=n;i++) cin >> a[i];
    bool ros = true;
    for(int i=2;i<=n;i++){
        if(a[i] <= a[i - 1]) ros = false;
    }
    if(ros){
        nie();
    }

    if(k == 2){
        minpref[1] = a[1];
        for(int i=2;i<=n;i++) minpref[i] = min(minpref[i - 1], a[i]);
        maxsuf[n] = a[n];
        for(int i=n-1;i>=1;i--){
            maxsuf[i] = max(maxsuf[i + 1], a[i]);
        }

        for(int i=1;i<n;i++){
            if(minpref[i] >= maxsuf[i + 1]){
                brane[i] = true;
                brane[n] = true;
                dokoncz();
            }
        }

        nie();
    }

    if(k == 3){
        int mini = a[1];
        int maxi = a[1];
        for(int i=2;i<=n;i++){
            mini = min(mini, a[i]);
            maxi = max(maxi, a[i]);
        }

        for(int i=2;i<=n;i++){
            if(a[i] == mini){
                brane[i] = true;
                brane[i - 1] = true;
                brane[n] = true;
                dokoncz();
            }
        }

        for(int i=1;i<n;i++){
            if(a[i] == maxi){
                brane[i] = true;
                if(i > 1) brane[i - 1] = true;
                brane[n] = true;
                dokoncz();
            }
        }

        nie();
    }

    int id = 1;
    for(int i=2;i<=n;i++){
        if(a[i] <= a[i - 1]){
            id = i;
            break;
        }
    }

    brane[id] = true;
    brane[id - 1] = true;
    if(id - 2 > 0) brane[id - 2] = true;
    brane[n] = true;
    dokoncz();
}
    
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();
    
    return 0;
}


/*
g++ -std=c++17 -Wall -Wshadow -Wextra -O2 -fsanitize=address -fsanitize=undefined c.cpp -o c
*/