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>
using namespace std;

#define int long long
#define ll long long
#define pb push_back
#define nd second
#define st first
#define sz size
#define forr(i, n) for(int i=1;i<=n;i++)
const ll infl=1e18+90;
const int inf=1e9+90;
const int roz=1e6+123;

int tab[roz], mx[roz], mn[roz], wyn[roz];
vector<int> wek;

priority_queue<pair<int,int>> kol;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, k;
    cin>>n>>k;
    for(int i=1; i<=n; i++)
    {
        cin>>tab[i];
    }
    if(k==2)
    {
        int maks=tab[n], mini=tab[1];
        for(int i=n; i>=1; i--)
        {
            maks=max(tab[i], maks);
            mx[i]=maks;
        }
        for(int i=1;i<=n;i++)
        {
            mini=min(tab[i], mini);
            mn[i]=mini;
        }
        for(int i=1;i<n;i++)
        {
            if(mn[i]>=mx[i+1])
            {
                cout<<"TAK\n";
                cout<<i<<endl;
                return 0;
            }
        }
    }
    else if(k==3)
    {
        int mini=tab[1];
        for(int i=2;i<=n;i++)
        {
            if(tab[i]<=mini)
            {
                if(i<n)
                {
                    wek.pb(i);
                    wyn[i]++;
                }
                else
                {
                    wek.pb(i-2);
                    wek[i-2]++;
                }
                wek.pb(i-1);
                wyn[i-1]++;
                break;
            }
            mini=min(mini, tab[i]);
        }
        int maxi=tab[n];
        for(int i=n-1;wek.empty()&&i>=1;i--)
        {
            if(tab[i]>=maxi)
            {
                wek.pb(i);
                wyn[i]++;
                if(i-1>=1)
                {
                    wek.pb(i-1);
                    wyn[i-1]++;
                }
                break;
            }
            maxi=max(maxi, tab[i]);
        }
    }
    else if(k>=4)
    {
        for(int i=2;i<=n;i++)
        {
            //cerr<<"dla i = "<<i<<" min = "<<mini<<"\n";
            if(tab[i]<=tab[i-1])
            {
                wek.pb(i);
                wek.pb(i-1);
                if(i-2>=1)
                {
                    wek.pb(i-2);
                    wyn[i-2]++;
                }
                wyn[i]++;
                wyn[i-1]++;
                break;
            }
        }
    }
    if(wek.empty())
    {
        cout<<"NIE\n";
        return 0;
    }
    cout<<"TAK\n";
    k--;
    k-=wek.size();
    for(int i=1;i<n;i++)
    {
        if(k!=0&&wyn[i]==0)
        {
            wek.pb(i);
            k--;
        }
    }
    sort(wek.begin(), wek.end());
    for(auto it:wek)
    {
        cout<<it<<" ";
    }
    cout<<endl;
}