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
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define pp pop_back
#define eb emplace_back
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int N=2e5+5, INF=1e9+5, mod=1e9+7;

int main(){
	//BOOST;
	int n, k;
	cin>>n>>k;
	vi V(n);
	for(int &i:V)cin>>i;
	if(k==2){
		vi pref(n), suf(n);
		for(int i=0; i<n; i++){
			if(i==0)pref[i]=V[i];
			else pref[i]=min(V[i], pref[i-1]);
		}
		for(int i=n-1; i>=0; i--){
			if(i==n-1)suf[i]=V[i];
			else suf[i]=max(V[i], suf[i+1]);
		}
		for(int i=0; i<n-1; i++){
			if(pref[i]>=suf[i+1]){
				cout<<"TAK\n";
				cout<<i+1;
				return 0;
			}
		}
	}
	else if(k==3){
		int mi=V[0], ma=V[0];
		for(int &i:V)mi=min(mi, i), ma=max(ma, i);
		if(V[0]==ma){
			cout<<"TAK\n";
			cout<<"1 2";
			return 0;
		}
		if(V[n-1]==mi){
			cout<<"TAK\n";
			cout<<n-2<<" "<<n-1;
			return 0;
		}
		for(int i=1; i<n-1; i++){
			if(V[i]==mi || V[i]==ma){
				cout<<"TAK\n";
				cout<<i<<" "<<i+1;
				return 0;
			}
		}
	}
	else{
		set<int> S;
		S.insert(0);
		S.insert(n);
		for(int i=0; i<n-1; i++){
			if(V[i]>=V[i+1]){
				cout<<"TAK\n";
				S.insert(i+1);
				S.insert(i);
				S.insert(i+2);
				for(int j=0; S.size()<k+1; j++){
					S.insert(j);
				}
				for(int i:S){
					if(i!=0 && i!=n){
						cout<<i<<" ";
					}
				}
				return 0;
			}
		}
	}
	cout<<"NIE\n";
	return 0;
}