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
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

//Jakub Misiaszek
//szablon czesciowo skopiowany z profilu https://codeforces.com/profile/Geothermal
using namespace std;
 
typedef long long LL;
typedef long double LD;
 
typedef pair<int, int> pii;
typedef pair<LL,LL> pll;
typedef pair<LD,LD> pdd;
 
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<LD> vld;
typedef vector<LL> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define rep(i, a, b) for (int i=a; i<(b); i++)
#define repd(i,a,b) for (int i = (a); i >= b; i--)
#define sz(x) (int)(x).size()
#define pb push_back
#define st first
#define nd second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define memo(x) memset(x, 0, sizeof(x))
#define debug(x) cerr << x << " "
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
LL losuj(LL a, LL b){ return a+rng()%(b-a+1);}

void solve(){
	int n, k; cin >> n >> k;
	vi t(n+1,0);
	for(int i = 1; i <= n; i++)
		cin >> t[i];

	if(k == 2){
		vi maxi(n+1,0);
		maxi[n] = t[n];
		for(int i = n - 1; i > 0; i--)
			maxi[i] = max(t[i], maxi[i+1]);

		int mini = t[1];
		for(int i = 1; i < n; i++){
			if(mini >= maxi[i+1]){
				cout << "TAK\n";
				cout << i << "\n";
				return;
			}
			mini = min(mini, t[i]);
		}
		cout << "NIE\n";
		return;
	}
	else if(k == 3){
		vi mini(n+1, 0), maxi(n+1, 0);
		mini[1] = t[1];
		maxi[n] = t[n];
		for(int i = 2; i <= n; i++)
			mini[i] = min(mini[i-1], t[i]);
		for(int i = n - 1; i > 0; i--)
			maxi[i] = max(t[i], maxi[i+1]);
		for(int i = 2; i < n; i++){
			if(mini[i-1] >= t[i] || t[i] >= maxi[i+1]){
				cout << "TAK\n";
				cout << i-1 << " " << i << "\n";
				return;
			}
		}
		cout << "NIE\n";
		return;
	}
	else{
		int x = 0;
		for(int i = 1; i < n; i++){
			if(t[i] >= t[i+1]){
				x = i;
				break;
			}
		}
		if(x == 0){
			cout << "NIE\n";
			return;
		}

		deque<int> Q;
		Q.push_back(x);
		if(x > 1)
			Q.push_front(x - 1);
		if(x < n - 1)
			Q.push_back(x + 1);

		while(Q.size() < k - 1){
			if(Q.front() > 1)
				Q.push_front(Q.front() - 1);
			else
				Q.push_back(Q.back() + 1);
		}
		cout << "TAK\n";
		while(!Q.empty()){
			cout << Q.front() << " ";
			Q.pop_front();
		}
		cout << "\n";
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = 1;
	//cin >> t;
	while (t--) solve();
	
	return 0;
}