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<bits/stdc++.h>
using namespace std;

constexpr int MAXN = 5e5+7;
constexpr int inf = 1e9 + 7;

int tab[MAXN];
int sufmax[MAXN];
int prefmin[MAXN];

int goodtri = -1;
int goodtwo = -1;
int goodquad = -1;

void init(int n)
{
    for (int i = 1; i <= n; i++)
        cin >> tab[i];

    prefmin[0] = inf;
    prefmin[1] = tab[1];
    for (int i = 2; i <= n; i++)
        prefmin[i] = min(prefmin[i - 1], tab[i]);

    sufmax[n] = tab[n];
    for (int i = n - 1; i >= 1; i--)
        sufmax[i] = max(sufmax[i + 1], tab[i]);

    for (int i = 2; i < n; i++){
        if (tab[i] == sufmax[i] || tab[i] == prefmin[i])
            goodtri = i;
    }
    
    for (int i = 1; i < n; i++){
        if (prefmin[i] >= sufmax[i + 1])
            goodtwo = i;
    }

    for (int i = 1; i < n - 1; i++)
    {
        if (tab[i] >= tab[i + 1])
            goodquad = i;
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n, k;
    cin >> n >> k;

    init(n);

    if (k == 2)
    {
        if (goodtwo == -1){
            cout << "NIE\n";
            return 0;
        }
        cout << "TAK\n";
        cout << goodtwo << "\n";
        return 0;
    }

    if (k == 3)
    {
        if (goodtri == -1){
            cout << "NIE\n";
            return 0;
        }
        cout << "TAK\n";

        vector <int> v;
        v.push_back(goodtri - 1);
        v.push_back(goodtri);

        for (int i = 1; i <= n; i++)
        {
            if (v.size() >= k - 1) break;
            if (i == goodtri - 1 || i == goodtri) continue;

            v.push_back(i);
        }

        sort(v.begin(), v.end());
        for (int i : v)
            cout << i << " ";
        cout << "\n";
        return 0;
    }

    if (goodquad == -1){
        cout << "NIE\n";
        return 0;
    }
    cout << "TAK\n";

    vector <int> v;
    v.push_back(goodquad - 1);
    v.push_back(goodquad);
    v.push_back(goodquad + 1);

    for (int i = 1; i <= n; i++)
    {
        if (v.size() >= k - 1) break;
        if (i == goodquad - 1 || i == goodquad || i == goodquad + 1) continue;

        v.push_back(i);
    }

    sort(v.begin(), v.end());
    for (int i : v)
        cout << i << " ";
    cout << "\n";

    return 0;
}