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

void solve() {
  ll n, k;
  cin >> n >> k;
  priority_queue<pair<ll, ll>> que;
  rep(i, n) {
    ll a;
    cin >> a;
    que.emplace(-a, i);
  }
  string s(n, 'o');
  while (k--) {
    auto [_, i] = que.top();
    que.pop();
    s[i] = 'x';
  }
  vector<ll> ans;
  rep(i, n - 1) {
    if (s[i] == 'x' && s[i + 1] == 'o') {
      ans.push_back(i + 2);
    }
  }
  cout << ans.size() << '\n';
  rep(i, ans.size()) cout << (i ? " " : "") << ans[i];
  cout << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}