#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#ifdef LOCAL
#include <algo/debug.h>
#else
#define debug(...) void(0)
#endif

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll N, K; cin >> N >> K;
    vector<ll> A(N), B(N); for(int i = 0; i < N; i++) cin >> A[i];
    copy(A.begin(), A.end(), B.begin());
    sort(A.begin(), A.end());
    ll p = A[K - 1];
    vector<ll> ans;
    for(int i = 1; i < N; i++) {
        if(B[i - 1] <= p && B[i] > p) ans.push_back(i + 1);
    }
    cout << int(ans.size()) << endl;
    for(auto a: ans) {
        cout << a << " ";
    }cout << endl;
}