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

using namespace std;
int CountBits (int x){
    int wyn=0;
    while (x){
        wyn+= x & 1;
        x=x>>1;
    }
    return wyn;
}
int main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);
    int n,k;
    cin>>n>>k;
    vector<int> tab;
    int a;
    for (int i=0; i<n; i++){ 
        cin>>a;
        tab.push_back(a);
    }

    vector<int> wyn;
    if (k==2){

        int mini=tab[0];

        for (int i=1; i<n-1; i++){ 
            mini=min(mini,tab[i]);
        }
        if (tab[n-1]<mini){
            wyn.push_back(n-1);
        };

        if (wyn.size()==0){
            int maxi=tab[n-1];
            for (int i=n-2; i<n-1; i++){ 
                maxi=max(maxi,tab[i]);
            }
            if (tab[0]>maxi){
                wyn.push_back(1);
            }
        }

    }
    if (k==3){
        int mini=tab[0];
        

        for (int i=1; i<n; i++){ 
            if (tab[i]<mini){
                if (i<n-2) {
                    wyn.push_back(i+2);
                }
                else wyn.push_back(i);
                wyn.push_back(i+1);
            }
            mini=min(mini,tab[i]);
            
        }
        
        
        int maxi=tab[n-1];

        for (int i=n-2; i>=0; i--){ 
            if (tab[i]>maxi){
                
                if (i==0) {
                    wyn.push_back(i+2);
                }
                else wyn.push_back(i);
                wyn.push_back(i+1);
                break;
            }
            maxi=min(mini,tab[i]);
        }
    }

    if (k>=4){
        int mini=tab[0];
        

        for (int i=1; i<n; i++){ 
            if (tab[i]<mini){
                wyn.push_back(i);
                break;
            }
            mini=min(mini,tab[i]);
            
        }
        
        
        int maxi=tab[n-1];

        for (int i=n-2; i>=0; i--){ 
            if (tab[i]>maxi){
                
                if (i==0) {
                    wyn.push_back(i+2);
                }
                else wyn.push_back(i);
                wyn.push_back(i+1);
                break;
            }
            maxi=min(mini,tab[i]);
        }

        k=k-wyn.size();

    }




    if (wyn.size()==0){
        cout<<"NIE";
        return 0;
    }
    cout<<"TAK"<<"\n";
    for (auto e:wyn){
        cout<<e<<" ";
    }
    return 0;
}