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

using namespace std;

class MaxQueue
{
    stack<pair<int, int>> s1;
    stack<pair<int, int>> s2;

public:
    int get_max()
    {
        if (s1.empty() || s2.empty())
            return s1.empty() ? s2.top().second : s1.top().second;
        else
            return max(s1.top().second, s2.top().second);
    }

    void push(int x)
    {
        int maximum = s1.empty() ? x : max(x, s1.top().second);
        s1.push({x, maximum});
    }

    void pop()
    {
        if (s2.empty())
        {
            while (!s1.empty())
            {
                int element = s1.top().first;
                s1.pop();
                int maximum = s2.empty() ? element : max(element, s2.top().second);
                s2.push({element, maximum});
            }
        }
        s2.pop();
    }
};

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    int tab[n];
    for (int i = 0; i < n; i++)
        cin >> tab[i];

    bool g = true;
    int id = 0;
    for (int i = 1; i < n; i++)
        if (tab[i - 1] >= tab[i])
        {
            g = false;
            id = i;
        }

    if (g)
    {
        cout << "NIE" << endl;
        return 0;
    }
    vector<int> odp, odp3;
    if (k == 2)
    {
        MaxQueue l, r;
        for (int i = 0; i < n; i++)
            r.push(tab[i]);
        for (int i = 0; i < n - 1; i++)
        {
            r.pop();
            l.push(-tab[i]);
            if (-l.get_max() >= r.get_max())
            {
                cout << "TAK" << endl;
                cout << i + 1 << endl;
                return 0;
            }
        }
        cout << "NIE" << endl;
        return 0;
    }
    if (k == 3)
    {
        MaxQueue l, r;
        for (int i = 1; i < n; i++)
            r.push(tab[i]);
        l.push(-tab[0]);
        for (int i = 1; i < n - 1; i++)
        {
            r.pop();
            l.push(-tab[i]);
            if (tab[i] >= r.get_max() || -l.get_max() >= tab[i])
            {
                cout << "TAK" << endl;
                cout << i << " " << i + 1 << endl;
                return 0;
            }
        }
        cout << "NIE" << endl;
    }
    if (k > 3)
    {
        if (id - 1 != 0)
        {
            odp3.push_back(id - 1);
            k--;
        }
        odp3.push_back(id);
        k--;
        if (id + 1 != n)
        {
            odp3.push_back(id + 1);
            k--;
        }
        int j = 1;
        while (k > 1)
        {
            if (j != id && j != id - 1 && j != id + 1)
            {
                odp.push_back(j);
                k--;
            }
            j++;
        }
        cout << "TAK" << endl;
        int i1 = 0, i2 = 0;
        for (int i = 0; i < odp.size() + odp3.size(); i++)
        {
            if (i1 < odp.size() && i2 < odp3.size())
            {
                if (odp[i1] > odp3[i2])
                {
                    cout << odp3[i2] << " ";
                    i2++;
                }
                else
                {
                    cout << odp[i1] << " ";
                    i1++;
                }
            }
            else if (i1 < odp.size())
            {
                cout << odp[i1] << " ";
                i1++;
            }
            else
            {
                cout << odp3[i2] << " ";
                i2++;
            }
        }
    }
    return 0;
}