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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
#include <bits/stdc++.h>

using namespace std;
#define PB push_back
#define LL long long
#define int LL
#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 REP(i,n) FOR(i,0,(int)(n)-1)
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define VI vector<int>
#define PII pair<int,int>
#define LD long double


template<class T> ostream &operator<<(ostream &os, vector<T> V){
    os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]";
}
template<class T, size_t N> ostream &operator<<(ostream &os, array<T, N> V){
    os<<"[";for(auto vv:V)os<<vv<<",";return os<<"]";
}


template<class L, class R> ostream &operator<<(ostream &os, pair<L,R> P) {
    return os << "(" << P.st << "," << P.nd << ")";
}



template<class C> void mini(C& a4, C b4) { a4 = min(a4, b4); }
template<class C> void maxi(C& a4, C b4) { a4 = max(a4, b4); }

template<class TH> void _dbg(const char *sdbg, TH h){cerr<<sdbg<<"="<<h<<"\n";}
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
    while(*sdbg!=',')cerr<<*sdbg++;cerr<<"="<<h<<","; _dbg(sdbg+1, a...);
}


#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif

optional<vector<int>> solve2(int n, const vector<int> & profits){
    // compute prefix minimums and suffix maximums
    vector<int> prefix_min(n);
    vector<int> suffix_max(n);
    prefix_min[0] = profits[0];
    suffix_max[n-1] = profits[n-1];
    FOR(i,1,n-1){
        prefix_min[i] = min(prefix_min[i-1], profits[i]);
    }
    FORD(i,n-2,0){
        suffix_max[i] = max(suffix_max[i+1], profits[i]);
    }
    // find if there is a point where prefix_min[i] > suffix_max[i+1]
    // if there is, return the point

    FOR(i,0,n-2){
        if(prefix_min[i] >= suffix_max[i+1]){
            return vector<int>{i};
        }
    }
    return {};
}

optional<vector<int>> solve3(int n, const vector<int> & profits){
    // check if minimum is only at the beginning
    // and if maximum is only at the end
    int min_pos = min_element(profits.begin() + 1, profits.end()) - profits.begin();
    int max_pos = max_element(profits.begin(), profits.end() - 1) - profits.begin();
    if(profits[min_pos] <= profits[0]){
        return {{min_pos - 1, min_pos}};
    }
    if(profits[max_pos] >= profits.back()){
        if(max_pos == 0){
            return {{0, 1}};
        } else{
            return {{max_pos - 1, max_pos}};
        }
    }
    return {};
}


optional<vector<int>> solve(int n, int k, const vector<int> & profits){
    if(k == 2)
        return solve2(n, profits);
    if(k == 3){
        return solve3(n, profits);
    }
    vector<bool> ans(n - 1);
    for(int i = 0; i < n - 1; i++){
        if(profits[i] >= profits[i + 1]){
            if(i){
                ans[i - 1] = true;
            }
            ans[i] = true;
            ans[i + 1] = true;
            int cnt = 2;
            for(int j = 0; j < n - 1 && cnt < k - 1; j++){
                if(!ans[j]){
                    cnt++;
                    ans[j] = true;
                }
            }
            // convert ans array to list of indices
            vector<int> ans2;
            REP(i,n-1){
                if(ans[i]){
                    ans2.push_back(i);
                }
            }
            return ans2;

        }
    }
    return {};
}

bool check(vector<int> ans, vector<int> profits){
    int idx = 0;
    int cur = 0;
    ans.push_back(profits.size());
    for(int a: ans){
        set<int> s;
        for(;idx < a; idx++){
            s.insert(profits[idx]);
        }
        auto it = s.upper_bound(cur);
        if(it == s.end())
            return true;
        cur = *it;
    }
    return false;
}

int32_t main() {
    default_random_engine gen;
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(11);
    cerr << fixed << setprecision(6);
    // read input
    // n k - integers
    // a1 a2 ... an - integers
    int n, k;
    cin >> n >> k;
    vector<int> profits(n);
    for (int i = 0; i < n; i++){
        cin >> profits[i];
    }
    auto r = solve(n, k, profits);
    if(!r.has_value()){
        cout << "NIE\n";
    } else{

        auto rv = r.value();
//        assert(rv.size() == k - 1);
//        assert(check(rv, profits));
        cout << "TAK\n";
        for(int a: rv){
            cout << a + 1 << " ";
        }
        cout << "\n";
    }
}