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

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  int l = 1, r = 1e9 + 7;
  while (r - l > 1) {
    int mid = (l + r) / 2;
    int cnt = 0;
    rep(i, n) cnt += a[i] <= mid;
    (cnt < k ? l : r) = mid;
  }
  vector<int> ans;
  rep(i, n - 1) if (a[i] <= l + 1 && a[i + 1] > l + 1) ans.push_back(i + 1);
  cout << ans.size() << '\n';
  rep(i, ans.size()) cout << ans[i] + 1 << ' ';
  cout << '\n';
  return 0;
}