#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=5e5+5;

bool mark[N];
int n,k,a[N],mn[N],mx[N];
bool check() {
	for (int i=1;i<n;i++) {
		if (a[i]>a[i+1]) {
			return 0;
		}
	}
	return 1;
}

signed main() {
	ios::sync_with_stdio(false),cin.tie(0);
	cout.precision(10),cout.setf(ios::fixed);
	
	cin>>n>>k;
	for (int i=1;i<=n;i++) {
		cin>>a[i];
	}
	if (check()) {
		cout<<"NIE\n";
		return 0;
	}
	if (k>=4) {
		int m=k-1;
		for (int i=1;i<n;i++) {
			if (a[i]>a[i+1]) {
				mark[i-1]=mark[i]=mark[i+1]=1;
				m--,m-=i+1<n,m-=i-1>=0;
				break;
			}
		}
		for (int i=1;i<n;i++) {
			if (m&&!mark[i]) {
				mark[i]=1;
				m--;
			}
		}
		cout<<"TAK\n";
		for (int i=1;i<n;i++) {
			if (mark[i]) {
				cout<<i<<" ";
			}
		}
	} else {
		mn[0]=1e9+7,mx[n+1]=0;
		for (int i=1;i<=n;i++) {
			mn[i]=min(mn[i-1],a[i]);
		}
		for (int i=n;i>=1;i--) {
			mx[i]=max(mx[i+1],a[i]);
		}
		if (k==2) {
			for (int i=1;i<n;i++) {
				if (mn[i]>mx[i+1]) {
					cout<<"TAK\n"<<i<<"\n";
					return 0;
				}
			}
			cout<<"NIE\n";
		} else {
			if (a[1]!=mn[n]) {
				for (int i=1;i<=n;i++) {
					if (a[i]==mn[n]) {
						cout<<"TAK\n"<<i-1<<' '<<i<<"\n";
						return 0;
					}
				}
			}
			if (a[n]!=mx[1]) {
				for (int i=1;i<=n;i++) {
					if (a[i]==mx[1]) {
						cout<<"TAK\n"<<i-1<<' '<<i<<"\n";
						return 0;
					}
				}
			}
			for (int i=2;i<n;i++) {
				if (a[i]==mn[n]||a[i]==mx[1]) {
					cout<<"TAK\n"<<i-1<<' '<<i<<"\n";
					return 0;
				}
			}
			cout<<"NIE\n";
		}
	}
	
	return 0;
}