#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k; cin >> n >> k;
  vector<int> a(n);
  for (int& a_i : a) cin >> a_i;
  int lb = a.front(), ub = ranges::max(a);
  while (ub - lb > 1) {
    const int mid = midpoint(lb, ub);
    int sum = 0;
    REP(i, n) {
      if (a[i] <= mid) ++sum;
    }
    (sum <= k ? lb : ub) = mid;
  }
  vector<int> ans;
  FOR(i, 1, n) {
    if (a[i - 1] <= lb && a[i] > lb) ans.emplace_back(i);
  }
  const int m = ans.size();
  cout << m << '\n';
  if (m == 0) {
    cout << '\n';
  } else {
    REP(i, m) cout << ans[i] + 1 << " \n"[i + 1 == m];
  }
  return 0;
}