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
#include <bits/stdc++.h>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, k;
	cin>>n>>k;
	
	vector <int> a(n);
	for(int i=0; i<n; ++i)
		cin>>a[i];
	
	int j;
	bool increasing=1;
	for(int i=1; i<n; ++i)
	{
		if(a[i]<=a[i-1])
		{
			increasing=0;
			j=i;
			break;
		}
	}
	
	if(increasing)
	{
		cout<<"NIE\n";
		return 0;
	}
	
	if(k==2)
	{
		vector <int> mini(n), maxi(n);
		
		mini[0]=a[0];
		for(int i=1; i<n; ++i)
			mini[i]=min(mini[i-1], a[i]);
		
		maxi[n-1]=a[n-1];
		for(int i=n-2; i>=0; --i)
			maxi[i]=max(maxi[i+1], a[i]);
		
		for(int i=0; i<n-1; ++i)
		{
			if(mini[i]>=maxi[i+1])
			{
				cout<<"TAK\n";
				cout<<i+1<<"\n";
				return 0;
			}
		}
	}
	else if(k==3)
	{
		vector <int> mini(n), maxi(n);
		
		mini[0]=a[0];
		for(int i=1; i<n; ++i)
			mini[i]=min(mini[i-1], a[i]);
		
		maxi[n-1]=a[n-1];
		for(int i=n-2; i>=0; --i)
			maxi[i]=max(maxi[i+1], a[i]);
		
		for(int i=1; i<n-1; ++i)
		{
			if(mini[i-1]>=a[i] || a[i]>=maxi[i+1])
			{
				cout<<"TAK\n";
				cout<<i<<" "<<i+1<<"\n";
				return 0;
			}
		}
	}
	else
	{
		cout<<"TAK\n";
		
		if(j==n-1)
		{
			for(int i=0; i<n; ++i)
			{
				if(k>3 || i==j-2 || i==j-1)
				{
					cout<<i+1<<" ";
					--k;
				}
			}
		}
		else
		{
			for(int i=0; i<n; ++i)
			{
				if(k>4 || i==j-2 || i==j-1 || i==j || (i>j && k>1))
				{
					cout<<i+1<<" ";
					--k;
				}
			}
		}
		
		cout<<"\n";
		return 0;
	}
	
	cout<<"NIE\n";
	return 0;
}