#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N, K;
    cin >> N >> K;
    vector<ll> A(N), S(N);
    rep(i, 0, N) {
        cin >> A[i];
        S[i] = A[i];
    }
    
    sort(all(S));
    
    ll t = S[K - 1];
    
    vector<int> ans;
    rep(i, 0, N - 1) {
        if (A[i] <= t && A[i + 1] > t) ans.push_back(i + 2);
    }
    
    cout << ans.size() << '\n';
    rep(i, 0, ans.size()) cout << ans[i] << ' ';
    cout << '\n';
}