#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 10;

int n, k, a[N], mn[N], mx[N];
bool flag[N];

signed main()
{
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    mn[1] = a[1]; for (int i = 2; i <= n; i++) mn[i] = min(mn[i - 1], a[i]);
    mx[n] = a[n]; for (int i = n - 1; i >= 1; i--) mx[i] = max(mx[i + 1], a[i]);
    bool f = false;
    if (k >= 2)
    {
        for (int i = 1; i <= n - 1; i++)
            if (mn[i] >= mx[i + 1])
            {
                f = flag[i] = true;
                break;
            }
    }
    if (!f && k >= 3)
    {
        for (int i = 2; i <= n - 1; i++)
            if (mn[i - 1] >= a[i] || a[i] >= mx[i + 1])
            {
                f = flag[i - 1] = flag[i] = true;
                break;
            }
    }
    if (!f && k >= 4)
    {
        for (int i = 2; i <= n - 1; i++)
            if (a[i - 1] >= a[i])
            {
                f = flag[i - 1] = flag[i] = flag[i + 1] = true;
                break;
            }
    }
    if (!f) cout << "NIE\n";
    else
    {
        cout << "TAK\n";
        int cnt = count(flag + 1, flag + n + 1, true);
        assert(cnt <= k - 1);
        for (int i = 1; i < n && cnt < k - 1; i++)
            if (!flag[i]) flag[i] = true, cnt++;
        for (int i = 1; i < n; i++)
            if (flag[i]) cout << i << ' ';
    }
}