/*
#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];
int ok1[maxn];
int k1;
int suf[maxn];
int pre[maxn];
void case2(){
	for(int i=1;i<n;i++){
		if(pre[i]>=suf[i+1]){
			cout<<"TAK\n";
			cout<<i;		
			return;
		}
	}
	cout<<"NIE\n";
}
void case3(){
	int mi=a[1];
	int cntmi=1;
	int ma=a[1];
	int cntma=1;
	for(int i=2;i<=n;i++){
		if(mi==a[i]){
			cntmi++;
		}
		else if(mi>a[i]){
			mi=a[i];
			cntmi++;
		}
		if(ma==a[i]){
			cntma++;
		}
		else if(ma>a[i]){
			cntma++;
		}
	}
	if(a[1]== mi && a[n]==ma && cntmi==1 && cntma==1){
		cout<<"NIE\n";
		return;
	}
	cout<<"TAK\n";
	for(int i=2;i<=n;i++){
		if(a[i]== ma ||a[i]==mi ){
			cout<<i-1<<" "<<i<<"\n";
		}
	}
	return;
}
void case4(){
	int check=0;
	for(int i=1;i<n;i++){
		if(a[i]>a[i+1]){
			ok[i]=1;
			ok[i-1]=1;
			ok[i+1]=1;
			k-=3;
			check=1;
		}
	}
	if(check==0){
		cout<<"NIE\n";
		return ;
	}
	if(ok[n]==0){
		ok[n]=1;
		k--;
	}
	for(int i=1;i<=n;i++){
		if(ok[i]==0 && k>0){
			ok[i]=1;
			k--;
		}
	}
	cout<<"TAK\n";
	for(int i=1;i<n;i++){
		if(ok[i])cout<<i<<" ";
	}
}
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]);
    }
    suf[n]=a[n];
    for(int i=n-1;i>=1;i--){
    	suf[i]=max(a[i],suf[i+1]);
    }
    pre[1]=a[1];
    for(int i=2;i<=n;i++){
    	pre[i]=min(pre[i-1],a[i]);
    }
    if(k==2)case2();
    else if(k==3)case3();
    else case4();
    return 0;
}