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
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int MAKS = 1e6 + 2;

const ll INF = 1e9;


ll tab[MAKS];
bool taken[MAKS];

ll maks_od_prawej[MAKS];
ll min_od_prawej[MAKS];

ll min_od_lewej[MAKS];
ll maks_od_lewej[MAKS];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n,k; cin >> n >> k;
    for(int i = 1 ; i <= n; i++)
    {
        cin >> tab[i];
    }
    maks_od_lewej[1] = tab[1];
    min_od_lewej[1] = tab[1];
    for(int i = 2 ; i <= n; i++)
    {
        maks_od_lewej[i] = max(maks_od_lewej[i-1],tab[i]);
        min_od_lewej[i] = min(min_od_lewej[i-1],tab[i]);
    }

    maks_od_prawej[n] = tab[n];
    min_od_prawej[n] = tab[n];

    for(int i = n-1; i >= 1; i--)
    {
        maks_od_prawej[i] = max(maks_od_prawej[i+1], tab[i]);
        min_od_prawej[i] = min(min_od_prawej[i+1], tab[i]);
    }

    string ans = "NIE";

    if(k == 2)
    {
        ll local_min = INF;
        for(int i = 1 ; i < n; i++)
        {
            
            //cout << "DEBUG: " << local_min << " " << maks_od_prawej[i+1] << "\n";
            if(min_od_lewej[i] >= maks_od_prawej[i+1])
            {
                ans = "TAK";
                taken[i] = 1;
                break;
            }
        }
    }
    if(k == 3)
    {
        for(int i = 2; i <= n-1; i++)
        {
            if(tab[i] >= maks_od_prawej[i+1] || tab[i] <= min_od_lewej[i-1])
            {
                ans = "TAK";
                taken[i-1] = 1;
                taken[i] = 1;
                break;
            }
        }
    }
    if(k > 3)
    {
        for(int i = 1 ; i < n; i++)
        {
            if(tab[i] >= min_od_prawej[i+1])
            {
                ans = "TAK";
                taken[i-1] = 1;
                for(int j = i+1; j < n; j++)
                {
                    if(tab[j] == min_od_prawej[i+1])
                    {
                        taken[j] = 1;
                        taken[j-1] = 1;
                    }
                }
                k -= 4;
                for(int j = 1; j <= n; j++)
                {
                    if(k > 0 && taken[j] == 0)
                    {
                        taken[j] = 1;
                        k--;
                    }
                }
                break;
            }
        }
    }

    cout << ans << "\n";
    if(ans == "TAK")
    {
        for(int i = 1; i < MAKS; i++)
        {
            if(taken[i] == 1) cout << i << " ";
        }
        cout << "\n";
    }
    



}