#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using mint = modint998244353;
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};

int n,k;
int main(){
    cin >> n >> k;
    vector<int>a(n);
    rep(i,n)cin>>a[i];
    int l=0,r=1001001001;
    while(r-l>1){
        int m=(l+r)/2;
        int cnt=0;
        rep(i,n)if(a[i]<=m)cnt++;
        //cerr<<m<<" "<<cnt<<" "<<l<<" "<<r<<endl;
        if(cnt>=k)r=m;
        else l=m;
    }
    //cerr<<" l:"<<l<<" r:"<<r<<endl;
    vector<int>ans;
    rep(i,n-1){
        cerr<<a[i]<<" "<<a[i+1]<<endl;
        if(a[i]<=r&&a[i+1]>r)ans.push_back(i+2);
    }
    cout<<ans.size()<<endl;
    rep(i,ans.size())cout<<ans[i]<<" ";
    cout<<endl;
}