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
141
142
143
144
145
146
147
148
149
150
151
152
153
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=500007;

int n,k;
int a[N];

int mxS[N];

vector<int>ans;

void solve2()
{
    for(int i=n;i>0;i--) mxS[i]=max(mxS[i+1],a[i]);
    int mn=inf;
    for(int i=1;i<n;i++)
    {
        mn=min(mn,a[i]);
        if(mn>=mxS[i+1])
        {
            cout<<"TAK"<<endl;
            cout<<i<<endl;
            //ans.pb(i);
            return ;
        }
    }
    cout<<"NIE"<<endl;
}

void solve3()
{
    for(int i=2;i<n;i++)
    {
        if(a[i]<=a[1])
        {
            cout<<"TAK"<<endl;
            cout<<i-1<<" "<<i<<endl;
            //ans.pb(i-1);
            //ans.pb(i);
            return ;
        }
    }
    for(int i=n-1;i>1;i--)
    {
        if(a[i]>=a[n])
        {
            cout<<"TAK"<<endl;
            cout<<i-1<<" "<<i<<endl;
            //ans.pb(i-1);
            //ans.pb(i);
            return ;
        }
    }
    cout<<"NIE"<<endl;
}

void solve4()
{
    for(int i=1;i<n;i++)
    {
        set<int>S;
        if(a[i]>=a[i+1])
        {
            cout<<"TAK"<<endl;
            int x=k-3-(i>1);
            for(int j=1;j<=n;j++)
            {
                if(j==i-1||j==i||j==i+1) cout<<j<<" ";
                else if(x>0)
                {
                    cout<<j<<" ";
                    x--;
                }
            }
            cout<<endl;
          /*  int x=k-3-(i>1);
            for(int j=1;j<=n;j++)
            {
                if(j==i-1||j==i||j==i+1) ans.pb(j);
                else if(x>0)
                {
                    ans.pb(j);
                    x--;
                }
            }*/
            return ;
        }
    }
    cout<<"NIE"<<endl;
}

bool is[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    if(k==2) solve2();
    else if(k==3) solve3();
    else solve4();
    //checker
   /* if(sz(ans)==0) return 0;
    for(auto x:ans) is[x]=1;
    vector<vector<int>>V;
    vector<int>X;
    for(int i=1;i<=n-1;i++)
    {
        X.pb(i);
        if(is[i])
        {
            V.pb(X);
            X.clear();
        }
    }
    X.pb(n-1);
    V.pb(X);
    memset(is,0,sizeof is);
    for(auto i:V[0]) is[i]=1;
    for(int j=1;j<k;j++)
    {
        for(auto i:V[j])
        {
            for(auto l:V[j-1])
            {
                if(is[l]&&a[l]<a[i]) is[i]=1;
            }
        }
    }
    bool ok=1;
    for(auto i:V[k-1]) if(is[i]) ok=0;
    if(!ok) cout<<"ZLE"<<endl;*/



    return 0;
}