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
#include <iostream>
#include <vector>

using namespace std;

// #define DEBUG
#ifdef DEBUG
#define dassert(x) assert(x);
#define df(...) printf(__VA_ARGS__)
#else
#define dassert(x)
#define df(...)
#endif

#define x first
#define y second
#define mp make_pair
#define pb push_back
#define ir(x, a, b) ((a) <= (x) && (x) <= (b))
#define vec vector
#define sz(x) (ll)x.size()
#define foru(i, n) for (int i = 0; (i) < (n); ++(i))
#define all(x) (x).begin(), (x).end()

typedef int64_t ll;

int read() {
    int n = 0; bool b = 0; char c = getchar();
    for (; !ir(c, '0', '9'); c = getchar()) b = (c == '-');
    for (; ir(c, '0', '9'); c = getchar()) n = 10*n + (c-'0');
    if (b) return -n;
    return n;
}

int main() {
    df("debug mode\n");
#ifndef DEBUG
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
    int n, k;
    cin >> n >> k;
    vec<ll> a(n);
    foru (i, n) cin >> a[i];
    if (k == 2) {
        vec<ll> mn(n), mx(n);
        mn[0] = a[0], mx[n-1] = a[n-1];
        for (int i = 1; i < n; ++i) mn[i] = min(mn[i-1], a[i]);
        for (int i = n-2; i >= 0; --i) mx[i] = max(mx[i+1], a[i]);
        foru (i, n-1) {
            if (mn[i] >= mx[i+1]) {
                cout << "TAK\n";
                #ifndef TEST
                cout << i+1 << "\n";
                #endif
                return 0;
            }
        }
        cout << "NIE\n";
    } else if (k == 3) {
        ll mn = 1e10, mx = 0;
        foru (i, n) mn = min(mn, a[i]);
        foru (i, n) mx = max(mx, a[i]);
        foru (i, n) {
            if (a[i] == mn && i != 0) {
                cout << "TAK\n";
                #ifndef TEST
                if (i == n-1)
                    cout << i-1 << " " << i << "\n";
                else
                    cout << i << " " << i+1 << "\n";
                #endif
                return 0;
            }
            if (a[i] == mx && i != n-1) {
                cout << "TAK\n";
                #ifndef TEST
                if (i == 0)
                    cout << i+1 << " " << i+2 << "\n";
                else 
                    cout << i << " " << i+1 << "\n";
                #endif
                return 0;
            }
        }
        cout << "NIE\n";
    } else {
        vec<bool> seps(n-1);
        --k;
        foru (i, n-1) {
            if (a[i] >= a[i+1]) {
                cout << "TAK\n";
                if (i == 0) {
                    k -= 2;
                    seps[0] = seps[1] = 1;
                } else if (i == n-2) {
                    k -= 2;
                    seps[n-3] = seps[n-2] = 1;
                } else {
                    k -= 3;
                    seps[i-1] = seps[i] = seps[i+1] = 1;
                }
                for (int i = 0; i < n-1 && k; ++i) {
                    if (!seps[i]) seps[i] = 1, --k;
                }
                #ifndef TEST
                foru (i, n-1) {
                    if (seps[i]) cout << i+1 << " ";
                }
                cout << "\n";
                #endif
                return 0;
            }
        }
        cout << "NIE\n";
    }
    return 0;
}