#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

int main(){
    int n, k, maks, min, a, flag = 0;
    int MIN;
    vector<int> pozycje;
    int tab[500000];
    cin >> n >> k;
    
    cin >> a;
    tab[0] = a;
    maks = a;
    min = a;
    MIN = a;
    pozycje.push_back(0);

    cin >> a;
    tab[1] = a;
    if(a > maks){
        maks = a;
    }
    else {
        flag = 1;
        min = a;
        if(a == MIN)
            pozycje.push_back(1);
        else if(a < MIN){
            pozycje.clear();
            pozycje.push_back(1);
            MIN = a;
        }
    }
    
    for(int i = 2; i < n; i++){
        cin >> a;
        tab[i] = a;
        if(flag == 0){
            if(a <= maks){
                flag = -1;
            }
            else{
                maks = a;
            }
        }
        else if(flag == 1){
            if((a > maks)||(a > min)){
                flag = -1;
            }
            else if(a < min){
                min = a;
            }
        }

        if(a == MIN){
            pozycje.push_back(i);
        }
        else if(a < MIN){
            MIN = a;
            pozycje.clear();
            pozycje.push_back(i);
        }
    }

    if(flag == 0){
        cout << "NIE" << endl;
    }
    else{
        if(flag == 1){
            cout << "TAK" << endl;
            for(int i = 1; i < k; i++){
                cout << i << " ";
            }
            cout << endl;
        }
        else{
            vector<int>::iterator it = pozycje.begin();
            vector<int>::iterator it2 = pozycje.begin();
            while (it != pozycje.end())
            {
                if(it + 1 == pozycje.end())
                    break;
                it++;
            }
            if(*it == n-1){
                cout << "TAK" << endl;
                stack<int> S;
                int x = *it;
                x++;
                k--;
                while(k > 0){
                    S.push(x);
                    x--;
                    k--;
                }
                while (!S.empty())
                {
                    cout << S.top() << " ";
                    S.pop();
                }
                cout << endl;
            }
            else if(*it2 == 0){
                if(k == 2){
                    cout << "NIE" << endl;
                }
                else{
                    int MAX = tab[1];
                    int posmax = 1;
                    for(int i = 2; i < n; i++){
                        if(tab[i] > MAX){
                            MAX = tab[i];
                            posmax = i;
                        }
                    }
                    if(posmax == n-1){
                        cout << "NIE" << endl;
                    }
                    else{
                        cout << "TAK" << endl;
                        vector<int> V;
                        k--;
                        int j = 1;
                        int b = 0;
                        V.push_back(posmax);
                        while(k > 1){
                            if(b == 0){
                                if(posmax+j <= n){
                                    V.push_back(posmax+j);
                                    k--;
                                }
                                b = 1;
                            }
                            else{
                                if(posmax-j > 0){
                                    V.push_back(posmax-j);
                                    k--;
                                }
                                j++;
                                b = 0;
                            }
                        }
                        sort(V.begin(), V.end());
                        it = V.begin();
                        while (it != V.end())
                        {
                            cout << *it << " ";
                            it++;
                        }
                        cout << endl;
                    }
                }
            }
            else{
                if(k == 2){
                    it = pozycje.begin();
                    int lmin = tab[0], rmax = tab[(*it)+1];
                    for(int i = 1; i < *it; i++){
                        if(tab[i] < lmin){
                            lmin = tab[i];
                        }
                    }
                    for(int i = (*it)+2; i < n; i++){
                        if(tab[i] > rmax){
                            rmax = tab[i];
                        }
                    }
                    if(lmin < rmax){
                        cout << "NIE" << endl;
                    }
                    else{
                        cout << "TAK" << endl;
                        cout << *it << endl;
                    }
                }
                else{
                    cout << "TAK" << endl;
                    vector<int> V;
                    k--;
                    it = pozycje.begin();
                    int j = 1;
                    int b = 0;
                    V.push_back(*it);
                    while(k > 1){
                        if(b == 0){
                            if((*it)+j <= n){
                                V.push_back((*it)+j);
                                k--;
                            }
                            b = 1;
                        }
                        else{
                            if((*it)-j > 0){
                                V.push_back((*it)-j);
                                k--;
                            }
                            j++;
                            b = 0;
                        }
                    }
                    sort(V.begin(), V.end());
                    it = V.begin();
                    while (it != V.end())
                    {
                        cout << *it << " ";
                        it++;
                    }
                    cout << endl;
                }
            }
        }
    }
    
    return 0;
}