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
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<stack>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef vector<LL> VLL;
typedef pair<int, int> PII;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    int n, k;
    cin >> n >> k;
    VI incomes(n), mins(n), maxs(n);
    REP(i, n) cin >> incomes[i];
    mins[0] = incomes[0];
    FOR(i, 1, n - 1) mins[i] = min(incomes[i], mins[i - 1]);
    maxs[n - 1] = incomes[n - 1];
    FORD(i, n - 2, 0) maxs[i] = max(incomes[i], maxs[i + 1]);
    if (k == 2) {
        int i = n - 1;
        while (i > 0) {
            if (maxs[i] <= mins[i - 1]) {
                cout << "TAK\n" << i << '\n';
                return 0;
            }
            i--;
        }
        cout << "NIE\n";
    } else if (k == 3) {
        int i = 1;
        while (i < n - 1) {
            if (incomes[i] <= mins[i - 1] || incomes[i] >= maxs[i + 1]) {
                cout << "TAK\n" << i << ' ' << i + 1 << '\n';
                return 0;
            }
            i++;
        }
        cout << "NIE\n";
    } else {
        int i = 1;
        while (i < n) {
            if (incomes[i] <= incomes[i - 1]) {
                cout << "TAK\n";
                int fixed = 3;
                if (i > 1 && i < n - 1) fixed++;
                int printed = 0;
                REP(j, min(i - 2, k - fixed)) {
                    cout << j + 1 << ' ';
                    printed++;
                }
                if (i > 1) {
                    cout << i - 1 << ' ';
                    printed++;
                }
                int j = i;
                while (printed < k - 1) {
                    cout << j << ' ';
                    printed++;
                    j++;
                }
                cout << '\n';
                return 0;
            }
            i++;
        }
        cout << "NIE\n";
    }
    return 0;
}