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

using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.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> prefMin(n);
		prefMin[0] = v[0];
		for(int i= 1; i < n; i++){
			prefMin[i] = min(prefMin[i-1], v[i]);
		}
		vector<int> sufMax(n);
		sufMax[n-1] = v[n-1];
		for(int i = n-2; i >= 0; i--){
			sufMax[i] = max(sufMax[i+1], v[i]);
		}
		for(int i =0; i < n-1; i++){
			//cout<<i<<" "<<prefMin[i]<<" "<<sufMax[i+1]<<"\n";
			if(prefMin[i] >=  sufMax[i+1]){
				cout<<"TAK\n";
				cout<<(i+1)<<"\n";
				return 0;
			}
		}
		cout<<"NIE\n";
		return 0;
	}else if(k == 3){
		int minVal = v[0];
		int maxVal = v[0];
		for(int i= 0; i < n; i++){
			minVal = min(minVal, v[i]);
			maxVal = max(maxVal, v[i]);
		}
		int minPos = -1;
		int maxPos = -1;
		for(int i= 1; i < n; i++){
			if(v[i] == minVal){
				minPos = i;
				break;
			}
		}
		for(int i = n-2; i >= 0; i--){
			if(v[i] == maxVal){
				maxPos = i;
				break;
			}
		}
		if(minPos == -1 && maxPos == -1){
			cout<<"NIE\n";
			return 0;
		}
		if(minPos != -1){
			cout<<"TAK\n";
			if(minPos == n-1){
				cout<<1<<" "<<(n-1)<<"\n";
			}else{
				cout<<minPos<<" "<<(minPos + 1)<<"\n";
			}
			return 0;
		}
		if(maxPos != -1){
			cout<<"TAK\n";
			if(maxPos == 0){
				cout<<"1 2"<<"\n";
			}else{
				cout<<maxPos<<" "<<(maxPos + 1)<<"\n";
			}
			return 0;
		}
	}else if(k >= 4){
		vector<bool> mark(n, false);
		bool increasing = true;
		for(int i= 0; i < n-1; i++){
			if(v[i] >= v[i+1]){
				if(i > 0){
					mark[i-1] = true;
					k--;
				}
				mark[i] = true;
				if(i + 1 < n-1){
					mark[i+1] = true;
					k--;
				}
				increasing = false;
				break;
			}
		}
		if(increasing){
			cout<<"NIE\n";
			return 0;
		}else{
			k -= 2;
			for(int i = 0; i < n; i++){
				if(k > 0 && !mark[i]){
					k--;
					mark[i] = true;
				}
			}
			cout<<"TAK\n";
			for(int i = 0; i < n; i++){
				if(mark[i])cout<<(i+1)<<" ";
			}
			cout<<"\n";
			return 0;
		}
	}
	return 0;
}