1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(1); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=501000;
int n,k;
int a[N],pm[N],sm[N];
int main() {
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;i++) {
		scanf("%d",&a[i]);
	}
	bool as=1;
	rep(i,1,n) if (a[i]>=a[i+1]) as=0;
	if (as) {
		puts("NIE");
		return 0;
	}
	set<int> ans;
	if (k>=4) {
		rep(i,1,n) if (a[i]>=a[i+1]) {
			ans.insert(i);
			if (i-1>=1) ans.insert(i-1);
			if (i+1<n) ans.insert(i+1);
			break;
		}
		rep(i,1,n) if (SZ(ans)<k-1) ans.insert(i);
		puts("TAK");
		for (auto p:ans) printf("%d ",p);
		puts("");
		return 0;
	}
	pm[0]=1<<30;
	sm[n+1]=0;
	rep(i,1,n+1) pm[i]=min(pm[i-1],a[i]);
	per(i,1,n+1) sm[i]=max(sm[i+1],a[i]);
	if (k==2) {
		rep(i,1,n) if (pm[i]>=sm[i+1]) {
			puts("TAK");
			printf("%d\n",i);
			return 0;
		}
		puts("NIE"); return 0;
	} else {
		rep(i,2,n) if (pm[i-1]>=a[i]||a[i]>=sm[i+1]) {
			puts("TAK");
			printf("%d %d\n",i-1,i);
			return 0;
		}
		puts("NIE"); return 0;
	}
}