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
#include <stdio.h>
#include <vector>
#include <algorithm>
int tab[500000];
bool res[500001]={};

int solveForOne(const int *t, const int n)
{
    std::vector<int> mi;
    std::vector<int> ma;
    mi.reserve(n);
    mi.reserve(n);
    mi.push_back(t[0]);
    for(int i = 1;i<n;i++)
    {
	mi.push_back(std::min(t[i], mi.back()));
    }
    ma.resize(n);
    ma[n-1] = t[n-1];
    for(int i = n-2; i>=0;i--)
	ma[i] = std::max(ma[i+1] , t[i]);
    for(int i = 0 ; i<n-1;i++)
    {
	if(mi[i] >=ma[i+1])
	{
	    return i+1;
	}
    }
    return -1;
}
int main()
{
    int n,k;;
    scanf("%d%d",&n,&k);
    std::vector<std::pair<int,int>> sorted;
    sorted.reserve(n);
    for(int i =0;i<n;i++)
    {
	scanf("%d",&tab[i]);
	sorted.push_back(std::make_pair(tab[i], i));
    }
    if( k == 2)
    {
	int res = solveForOne(tab, n);
	if(res == -1)
	    printf("NIE\n");
	else
	{
	    printf("TAK\n");
           printf("%d\n",res);
	}
	return 0;

    }
    std::sort(sorted.begin(), sorted.end(), [](const auto& lhs, const auto& rhs) { return lhs.first > rhs.first || (lhs.first == rhs.first && lhs.second <  rhs.second);});
    int cur = n-1;
    int count = 0 ;
    for(int  i=0;i<sorted.size();i++)
    {
	if(sorted[i].second == cur)
	{
	    count++;
	    cur--;
	}
	else 
	    break;
    }

   if(cur == -1 )
    {
	printf("NIE\n");
	return 0;
    }

    //n=8
    //cur = 7 -> 5, count = 2
    //1 1 1 1 8 7 | 9 10


   // 4 5 |3 |9 10

   // 9| 8 8 |10 

    if(cur < n-1)
    {
	if(k == 3)
	{
	    int p = solveForOne(tab, n-count);
	    if(p==-1)
	    {
		printf("NIE\n");
	    }
	    else
	    {
		printf("TAK\n");
		printf("%d %d\n", p , cur+1);
	    }
	    return 0;
	}
    }


    int pos = sorted[count].second; 
    res[pos+1] = true;
    k--;
    if(pos > 0)
    {
	res[pos] = true;
	k--;
    }
    if(cur < n-1)
    {
	res[pos+2] = true;
	k--;
    }


    if(k<1)
    {
	printf("NIE\n");
	return 0;
    }

    for(int i =1;i<n;i++)
    {
	if(k==1) break;
	if(!res[i])
	{
	    k--;
	    res[i] = true;
	}

    }
    printf("TAK\n");
    for(int i  = 1 ;i<=n;i++)
	if(res[i])
		printf("%d ", i);
    printf("\n");
}