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
// Autor: Adam Szymaszkiewicz
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int main()
{
	ios::sync_with_stdio(0); cin.tie(0);

	int n, k;
	cin >> n >> k;
	vector<int> v(n);
	for (int i = 0; i < n; i++)
		cin >> v[i];
	if (k == 2)
	{
		vector<int> mini(n);
		mini[0] = v[0];
		for (int i = 1; i < n; i++)
			mini[i] = min(mini[i-1], v[i]);
		vector<int> maxi(n);
		maxi[n-1] = v[n-1];
		for (int i = n-2; i >= 0; i--)
			maxi[i] = max(maxi[i+1], v[i]);
		int wyn = -1;
		for (int i = 0; i < n-1; i++)
		{
			if (mini[i] >= maxi[i+1])
			{
				wyn = i;
				break;
			}
		}
		if (wyn == -1)
			cout << "NIE\n";
		else
		{
			cout << "TAK\n";
			cout << wyn+1 << "\n";
		}
	}
	else if (k == 3)
	{
		int mini, maxi;
		mini = maxi = 0;
		for (int i = 1; i < n; i++)
		{
			if (v[i] <= v[mini])
				mini = i;
			if (v[i] > v[maxi])
				maxi = i;
		}
		if (mini == 0 && maxi == n-1)
			cout << "NIE\n";
		else
		{
			cout << "TAK\n";
			if (mini == n-1)
				cout << "1 " << mini << "\n";
			else if (mini != 0)
				cout << mini << " " << mini+1 << "\n";
			else if (maxi == 0)
				cout << maxi+1 << " " << n-1 << "\n";
			else if (maxi != n-1)
				cout << maxi << " " << maxi+1 << "\n";
		}
	}
	else
	{
		int poz = -1;
		for (int i = 0; i < n-1; i++)
		{
			if (v[i] >= v[i+1])
			{
				poz = i;
				break;
			}
		}
		if (poz == -1)
			cout << "NIE\n";
		else
		{
			cout << "TAK\n";
			vector<int> odp;
			if (poz == 0)
				odp = {poz+1, poz+2};
			else
				odp = {poz, poz+1, poz+2};
			for (int i = 0; i < poz-1; i++)
			{
				if (odp.size() == k-1)
					break;
				odp.push_back(i+1);
			}
			if (odp.size() < k-1)
			{
				for (int i = poz+2; i < n; i++)
				{
					if (odp.size() == k-1)
						break;
					odp.push_back(i+1);
				}
			}
			sort(odp.begin(), odp.end());
			for (int i = 0; i < k-1; i++)
				cout << odp[i] << " ";
			cout << "\n";
		}
	}
}