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
131
132
133
134
135
136
137
138
139
140
#include<bits/stdc++.h>
using namespace std;

int n, k, ans, zle;

int t[500006], ma[500006], mi[500006], emi, ema, el1, el2, el;

int main()
{
	cin >> n >> k;
	for(int i = 0; i < n; i ++)
	{
		cin >> t[i];
		if(i == 0)
			mi[i] = t[i];
		else
			mi[i] = min(mi[i - 1], t[i]);
	}
	
	zle = 1;
	for(int i = n - 1;i >= 0; i --)
	{
		ma[i] = max(ma[i + 1], t[i]);
		if(i > 0 && t[i] > t[i - 1])
		{
			zle ++;
		}
	}


	if(zle == n)
		cout << "NIE\n";
	if(k == 2)
	{
		ans = -1;
		for(int i = 0; i < n - 1; i ++)
		{
			if(mi[i] > ma[i + 1])
				ans = i;
		}
		if(ans == -1)
			cout << "NIE\n";
		else
		{
			cout << "TAK\n";
			cout << ans + 1 << "\n";
		}
	}
	else if(k == 3)
	{
		emi = mi[n - 1];
		ema = ma[0];
		zle = 0;
		for(int i = 1; i < n - 1; i ++)
		{
			if(emi == t[i])
			{
				zle = 1;
				el = i;
			}
			if(ema == t[i])
			{
				zle = 1;
				el = i;
			}
		}
		if(emi == t[n - 1])
		{
			zle = 1;
			el = n - 1;
		}
		else if(ema == t[0])
		{
			zle = 1;
			el = 0;
		}
		if(!zle)
		{
			cout << "NIE\n";
			return 0;
		}
		else
		{
			cout << "TAK\n";
			if(el == 0)
			{
				cout << el + 1 << " " << el + 2 << "\n";
			}
			else
			{
				cout << el << " " << el + 1 << "\n";
			}
		}
	}
	else
	{
		cout << "TAK\n";
		for(int i = 0; i < n; i ++)
			ma[i] = 0;

		for(int i = 0; i < n - 1; i ++)
		{
			if(t[i] >= t[i + 1])
			{
				zle = i;
				break;
			}
		}
		el = k - 1;
		if(zle == n - 2)
		{
			ma[zle] = 1;
			ma[zle + 1] = 1;
			el -= 2;
		}
		else
		{
			ma[zle] = 1;
			ma[zle + 1] = 1;
			ma[zle + 2] = 1;
			el -= 3;
		}

		for(int i = 0; i < n; i ++)
		{
			if(el > 0 && ma[i] == 0)
			{
				ma[i] = 1;
				el --;
			}
		}

		for(int i = 0; i < n; i ++)
			if(ma[i])
				cout << i << " ";

	}

	return 0;
}