#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    A.push_back(INF);

    vector<int> B = A;
    sort(B.begin(), B.end());
    int border = B[K];

    vector<int> ans;
    for (int i = 1; i < N; i++) {
        if (A[i - 1] < border && A[i] >= border) {
            ans.push_back(i);
        }
    }

    cout << ans.size() << endl;
    for (int x : ans) {
        cout << ++x << ' ';
    }
    cout << endl;
}