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

using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;
	vector <int> v;
	for (int i = 0; i < n; i++) {
		int val;
		cin >> val;
		v.push_back(val);
	}

	if (k >= 4) {
		int pos = -1;
		
		for (int i = 0; i < n - 1; i++) {
			if (v[i] > v[i + 1]) {
				pos = i;
				break;
			}
		}

		if (pos == -1) {
			cout << "NIE\n";
			return 0;
		}

		cout << "TAK\n";
		
		if(pos + 2 < k) {
			for (int i = 1; i < k; i++) {
				cout << i << ' ';
			}
		}
		else if (pos == n - 2) {
			for (int i = n - k + 1; i < n; i++) {
				cout << i << ' ';
			}
		}
		else {
			for (int i = pos - k + 4; i <= pos + 2; i++) {
				cout << i << ' ';
			}
		}
		
		cout << '\n';
	}
	else {
		vector <int> minL;
		vector <int> maxR;
		minL.resize(n);
		maxR.resize(n);

		int c_max = 0;
		int c_min = 2000000000;

		for (int i = 0; i < n; i++) {
			if (v[i] < c_min) {
				c_min = v[i];
			}
			minL[i] = c_min;
		}

		for (int i = n - 1; i >= 0; i--) {
			if (v[i] > c_max) {
				c_max = v[i];
			}
			maxR[i] = c_max;
		}

		if (k == 2) {
			for (int i = 0; i < n - 1; i++) {
				if (minL[i] >= maxR[i + 1]) {
					cout << "TAK\n" << i + 1 << '\n';
					return 0;
				}
			}
		}
		else {
			for (int i = 1; i < n - 1; i++) {
				if (minL[i - 1] >= v[i] || maxR[i + 1] <= v[i]) {
					cout << "TAK\n" << i << ' ' << i + 1 << '\n';
					return 0;
				}
			}
		}

		cout << "NIE\n";
	}
}