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

int main(){
    int N,K,a;
    cin >> N >> K;
    vector<int> A(N),X(N);
    for(int i=0;i<N;i++){
        cin >> a;
        A[i] = a;
        X[i] = a;
    }
    sort(X.begin(),X.end());
    int thereshold = X[K-1];
    int count = 0;
    for(int k=1;k<N;k++){
        if(A[k] > thereshold && A[k-1] <= thereshold){
            count++;
        }
    }
    cout << count << endl;
    for(int k=1;k<N;k++){
        if(A[k] > thereshold && A[k-1] <= thereshold){
            cout << k+1 << " ";
        }
    }
}