#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

int main(){
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    rep(i, 0, N) cin >> A[i];

    vector<int> B = A;
    sort(B.begin(), B.end());

    int thre = B[K-1];
    vector<int> ans;
    rep(i, 1, N){
        if(A[i-1] <= thre && A[i] > thre){
            ans.push_back(i+1);
        }
    }

    int n = ans.size();
    cout << n << endl;
    rep(i, 0, n){
        cout << ans[i];
        cout << (i == n-1 ? '\n' : ' ');
    }

    return 0;
}