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
#include <bits/stdc++.h>
using namespace std;
constexpr int maxN = 5e5+7;

int n,k,a[maxN],pref[maxN],suf[maxN],A,B,C;
/// min pref, max suf
bool rosnace=true;
vector<int>ans;

bool jest(int x){
    return (x == A || x == B || x == C);
}

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

    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        if(a[i] <= a[i-1])
            rosnace = false;
    }
    pref[1] = a[1];
    for(int i=2;i<=n;i++)
        pref[i] = min(pref[i-1], a[i]);
    suf[n] = a[n];
    for(int i=n-1;i>=1;i--)
        suf[i] = max(suf[i+1], a[i]);

    /*
    for(int i=1;i<=n;i++)
        cout<<pref[i]<<' ';
    cout<<"\n";
    for(int i=1;i<=n;i++)
        cout<<suf[i]<<' ';
    cout<<"\n";
    */
    
    if(rosnace){
        cout<<"NIE\n";
        return 0;
    }
    if(k == 2){
        for(int i=1;i<n;i++)
            if(pref[i] >= suf[i+1]){
                cout<<"TAK\n";
                cout<<i<<"\n";
                return 0;
            }
        cout<<"NIE\n";
        return 0;
    }
    else if(k == 3){
        for(int i=2;i<=n;i++){
            if(a[i] <= pref[i-1]){
                cout<<"TAK\n";
                
                if(i != n)
                    cout<<i-1<<' '<<i<<"\n";
                else
                    cout<<1<<' '<<i-1<<"\n";
                
                return 0;
            }
        }
        for(int i=n-1;i>=1;i--){
            if(a[i] >= suf[i+1]){
                cout<<"TAK\n";
                
                if(i != 1)
                    cout<<i-1<<' '<<i<<"\n";
                else
                    cout<<1<<' '<<n-1<<"\n";
                
                return 0;
            }
        }
        cout<<"NIE\n";
        return 0;
    }

    for(int i=1;i<n;i++){
        if(a[i] >= a[i+1]){
            B = i;
            k--;
            if(i != 1){
                A = i-1;
                k--;
            }
            if(i != n-1){
                C = i+1;
                k--;
            }
        }
    }
    if(A)
        ans.push_back(A);
    if(B)
        ans.push_back(B);
    if(C)
        ans.push_back(C);
    for(int i=1;i<n;i++){
        if(k == 1)
            break;
        if(!jest(i)){
            ans.push_back(i);
            k--;
        }
    }
    sort(ans.begin(), ans.end());
    cout<<"TAK\n";
    
    for(int x:ans)
        cout<<x<<' ';
    cout<<"\n";
	
}

/*

6 3
3 5 4 8 3 7

4 2
2 3 2 3

3 3
1 3 2


*/