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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, m, k;
int tab[1000007], minpref[1000007], maxsuf[1000007];
set <int> res;
vector <int> res2;

int solve()
{
    cin >> n >> k;
    //n = 500000;
    //k = 500000;

    minpref[0] = INF;
    maxsuf[n+1] = -INF;

    FOR(i, 1, n)
    {
        cin >> tab[i];
        //tab[i] = n+1-i;
        minpref[i] = min(minpref[i-1], tab[i]);
    }
    FORD(i, n, 1)
        maxsuf[i] = max(maxsuf[i+1], tab[i]);

    if(k == 2)
    {
        FOR(i, 1, n-1)
        {
            if(minpref[i] >= maxsuf[i+1])
            {
                res.insert(i);
                return 1;
            }
        }
        return 0;
    }
    if(k == 3)
    {
        FOR(i, 1, n)
        {
            if(i > 1 && minpref[i-1] >= tab[i])
            {
                res.insert(i-1);
                res.insert(i);
                return 1;
            }
            if(i < n && tab[i] >= maxsuf[i+1])
            {
                res.insert(i-1);
                res.insert(i);
                return 1;
            }
        }
        return 0;
    }

    FOR(i, 1, n-1)
    {
        if(tab[i] >= tab[i+1])
        {
            res.insert(i-1);
            res.insert(i);
            res.insert(i+1);

            return 1;
        }
    }

    return 0;
}

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

    if(solve())
    {
        cout << "TAK\n";

        if(res.count(0) > 0)
            res.erase(0);
        if(res.count(n) > 0)
            res.erase(n);

        for(int i=1; (int)(res.size() + res2.size()) < k-1; i++)
            if(res.count(i) == 0)
                res2.PB(i);

        for(auto el : res)
            res2.PB(el);

        sort(res2.begin(), res2.end());


        for(auto el : res2)
            if(el <= 0 || el >= n)
                cout << "ZLE\n";
        if(res2.size() != k-1)
            cout << "ZLE\n";
        for(int i=1; i < res2.size(); i++)
            if(res2[i-1] >= res2[i])
                cout << "ZLE\n";

        for(auto el: res2)
            cout << el << " ";
        cout << '\n';

    }
    else
        cout << "NIE\n";

    return 0;
}