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
#include <iostream>
#include <bitset>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

const int INF = 1e9+7;

void solve() {
	int n, k;
	cin >> n >> k;
	vector<int> a(n+1);
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	
	if (k == 2) {
		int maxi = 0;
		vector<int> aMini(n+1);
		aMini[1] = a[1];
		for (int i = 2; i <= n; i++)
			aMini[i] = min(aMini[i-1], a[i]);

		for (int i = n; i >= 2; i--) {
			maxi = max(maxi, a[i]);
			if (aMini[i-1] >= maxi) {
				cout << "TAK\n";
				cout << i-1;
				return;
			}
		}
		cout << "NIE";
		return;
	}
	if (k == 3) {
		vector<int> mini(n+2), maxi(n+2);
		mini[1] = a[1];
		for (int i = 2; i <= n; i++)
			mini[i] = min(mini[i-1],a[i]);
		maxi[n] = a[n];
		for (int i = n-1; i >= 1; i--)
			maxi[i] = max(maxi[i+1],a[i]);

		// skrajny z lewej
		if (a[1] >= maxi[2]) {
			cout << "TAK\n";
			cout << "1 2";
			return;
		}
		// skrajny z prawej
		if (a[n] <= mini[n-1]) {
			cout << "TAK\n";
			cout << n-1 << " " << n;
			return;
		}
		// w srodku
		for (int i = 2; i < n; i++) {
			if (a[i] <= mini[i-1]) {
				cout << "TAK\n";
				cout << i-1 << " " << i;
				return;
			}
			if (a[i] >= maxi[i+1]) {
				cout << "TAK\n";
				cout << i-1 << " " << i;
				return;
			}
		}
		cout << "NIE";
	}
	if (k >= 4) {
		for (int i = 2; i <= n; i++) {
			if (a[i] <= a[i-1]) {
				cout << "TAK\n";
				int x=0;
				// i-2
				// i-1
				// i
				
				for (int j = 1; j < i-2; j++) {
					if (x >= k-2)
						break;
					cout << j << " ";
					x++;
				}

				if (i >= 3) {
					cout << i-2 << " ";
					x++;
				}
				cout << i-1 << " " << i << " ";
				x += 2;

				for (int j = i+1; j <= n; j++) {
					if (x == n+1)
						break;
					cout << j << " ";
					x++;
				}

				return;
			}
		}
		cout << "NIE\n";
	}
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	solve();
	cout << '\n';

	return 0;
}