/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define BIT(x,i) (1&((x)>>(i)))
#define MASK(x) (1LL<<(x))
#define task "tnc"  
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,k;
vector<int>vt;
vector<int>pos[maxn];
int ok[maxn];
int a[maxn];
signed main()
{
	cin.tie(0),cout.tie(0)->sync_with_stdio(0);
    //freopen(task".inp" , "r" , stdin);
    //freopen(task".out" , "w" , stdout);
    cin>>n>>k;
    for(int i=1;i<=n;i++){
    	cin>>a[i];
    	vt.pb(a[i]);
    }
    sort(vt.begin(),vt.end());
    vt.resize(distance(vt.begin(),unique(vt.begin(),vt.end())));
    for(int i=1;i<=n;i++){
    	a[i]=lower_bound(vt.begin(),vt.end(),a[i])-vt.begin();
    	pos[a[i]].pb(i);
    }
    // 0 2 1
    int ht=n;
    for(int i=len(vt)-1;i>=0;i--){
    	int q=pos[i][0];
    	if(k>=3 && q<ht){
    		ok[q]=1;
    		ok[q-1]=1;
    		k-=2;

    		break;
    	}
    	else{
    		ok[q]=1;
    		k--;
    		ht--;
    	}
    }
    for(int i=1;i<n;i++){
    	if(k>1 && ok[i]==0){
    		ok[i]=1;
    		k--;
    	}
    }
    vector<int>ans;
    for(int i=1;i<=n;i++){
    	if(ok[i]==1){
    		ans.pb(i);
    	}
    }
    if(k==1){
    	cout<<"TAK\n";
    	for(auto v:ans){
    		cout<<v<<" ";
    	}
    }
    else{
    	cout<<"NIE\n";
    }
    return 0;
}