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
130
#include <chrono>
#include <cassert>
#include <string>
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <iterator>
#include <algorithm>
#include <cmath>
#include <complex>
#include <numeric>
#include <random>
#include <ios>
#include <iostream>
#include <bitset>
using namespace std; 

#define fwd(i, a, b) for (int i = (a); i < (b); ++ i)
#define rep(i, n) for (int i = 0; i < (n); ++ i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
#define fastio ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ll long long

#ifdef LOCAL
template<typename Stream, typename T1, typename T2>
Stream& operator << (Stream& out, pair<T1, T2> a) {return out << "(" << a.st << ", " << a.nd << ")";}
 
template<typename Stream, typename T>
Stream &operator << (Stream& out, T v) {
	out << "{";
	int i = 0;
	for (auto x : v)
		out << x << ((++ i) != sz(v) ? ", " : "");
	return out << "}";
}

template<typename... Args>
void dump(Args... x) {((cerr << x << ", "), ...) << '\n';}
 
#define debug(x...) cerr << "[" #x "]: ", dump(x)
#else
#define debug(...) 0
#endif

int32_t main() {
	fastio;
	int n, k;
	cin >> n >> k;
	vi a(n);
	rep(i, n)
		cin >> a[i];
	if (k == 2) {
		vi p(n), s(n);
		p[0] = a[0];
		fwd(i, 1, n)
			p[i] = min(p[i - 1], a[i]);
		s[n - 1] = a[n - 1];
		int odp = -1;
		for (int i = n - 2; i >= 0; -- i) {
			s[i] = max(s[i + 1], a[i]);
			if (p[i] >= s[i + 1])
				odp = i;
		}
		if (odp == -1) {
			cout << "NIE\n";
			return 0;
		}
		cout << "TAK\n";
		cout << odp + 1 << '\n';
		return 0;
	}
	vector<bool> taken(n, false);
	if (k == 3) {
		int p = -1;
		fwd(i, 1, n)
			if (a[i] <= a[0] && (p == -1 || a[i] <= a[p]))
				p = i;
		if (p == -1) {
			rep(i, n - 1)
				if (a[i] >= a[n - 1] && (p == -1 || a[i] >= a[p]))
					p = i;
		}
		if (p == -1) {
			cout << "NIE\n";
			return 0;
		}
		taken[p] = true;
		-- k;
		if (p != 0) {
			taken[p - 1] = true;
			-- k;
		}
	} else {
		int p = -1;
		rep(i, n - 1)
			if (a[i] >= a[i + 1])
				p = i;
		if (p == -1) {
			cout << "NIE\n";
			return 0;
		}
		k -= 2;
		taken[p] = true;
		taken[p + 1] = true;
		if (p != 0) {
			taken[p - 1] = true;
			-- k;
		}
	}
	for (int i = n - 1; i >= 0; -- i)
		if (k > 0 && !taken[i]) {
			taken[i] = true;
			-- k;
		}
	cout << "TAK\n";
	rep(i, n - 1)
		if (taken[i])
			cout << i + 1 << ' ';
	return 0;
}