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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/*
    Jakub Żojdzik
    13-12-2022
*/

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...)
#define dt
#endif
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<pair<long long, long long>> vpll;

#define fi first
#define se second
#define pb push_back
#define rep(i, x, y) for(ll i = (ll)x; i <= (ll)y; i++)
#define all(x) x.begin(), x.end()
#define sz(x) (ll)(x).size()
#define nl cout << '\n'

ll tab[500007];
ll gora[500007], dol[500007];
bitset<500007> sciana;

int main()
{
    cout.tie(0);
    cin.tie(0)->sync_with_stdio(0);

    ll n, k;
    cin >> n >> k;
    bool rosn = 1;
    ll najw = -1;
    rep(i, 1, n)
    {
        cin >> tab[i];
        if(i > 1 && tab[i] <= tab[i-1]) rosn = 0;
        najw = max(najw, tab[i]);
    }

    dol[0] = 1e9+7;
    gora[n+1] = -1;
    rep(i, 1, n)
    {
        dol[i] = min(dol[i-1], tab[i]);
    }
    for(int i = n; i >= 1; i--)
    {
        gora[i] = max(gora[i+1], tab[i]);
    }

    if(rosn)
    {
        cout << "NIE\n";
        return 0;
    }

    if(k >= 4)
    {
        rep(i, 2, n)
        {
            if(tab[i] <= tab[i-1])
            {
                sciana[i-2] = 1;
                sciana[i-1] = 1;
                sciana[i] = 1;
                break;
            }
        }
    }
    if(k == 3)
    {
        ll akt = tab[1];
        bool done = 0;
        rep(i, 2, n)
        {
            if(tab[i] <= akt)
            {
                sciana[i-1] = 1;
                sciana[i] = 1;
                done = 1;
                break;
            }
            akt = min(akt, tab[i]);
        }

        if(!done)
        {
            akt = tab[n];
            for(int i = n-1; i >= 1; i--)
            {
                if(tab[i] >= akt)
                {
                    sciana[i-1] = 1;
                    sciana[i] = 1;
                    break;
                }
                akt = max(akt, tab[i]);
            }
        }
    }
    if(k == 2)
    {
        rep(i, 1, n-1)
        {
            if(dol[i] >= gora[i+1])
            {
                sciana[i] = 1;
                break;
            }
        }
    }


    ll cnt = 0;
    rep(i, 1, n-1)
    {
        if(sciana[i]) cnt++;
    }
    if(!cnt)
    {
        cout << "NIE\n";
        return 0;
    }
    cout << "TAK\n";
    ll jeszcze = k - cnt - 1;
    rep(i, 1, n)
    {
        if(sciana[i]) cout << i << " ";
        else if(jeszcze)
        {
            cout << i << " ";
            jeszcze--;
        }
    }
    nl;
}

/*

*/