#include<bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
  ll n,k;
  cin>>n>>k;
  vector<ll> a(n);
  for(ll i=0;i<n;i++){
    cin>>a[i];
  }
  vector<ll> b=a;
  sort(a.begin(),a.end());
  ll ok=1,ng=1e18;
  while(abs(ok-ng)>1){
    ll mid=(ok+ng)/2;
    if(upper_bound(a.begin(),a.end(),mid)-a.begin()<=k){
      ok=mid;
    }else{
      ng=mid;
    }
  }
  vector<ll> ans;
  for(ll i=0;i<n;i++){
    if(i==0&&b[i]>ok){
      ans.push_back(i+1);
    }else if(i>0&&b[i-1]<=ok&&b[i]>ok){
      ans.push_back(i+1);
    }
  }
  cout<<ans.size()<<endl;
  for(ll i=0;i<(ll)ans.size();i++){
    cout<<ans[i]<<" ";
  }
  cout<<endl;
}