#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
long long k;
bool first(long long val) {
  long long tot = 0;
  for (int i = 1; i <= n; i++) tot += min(val, (long long)a[i]);
  return (tot <= k);
}
int main() {
  int i, j;
  long long ans = 0;
  scanf("%d", &n);
  scanf("%lld", &k);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    ans += a[i];
  }
  if (ans < k)
    return printf("-1\n"), 0;
  else if (ans == k)
    return printf("\n"), 0;
  long long lo = 0, hi = (long long)1e16;
  while (hi - lo > 1) {
    long long mid = (hi + lo) / 2;
    if (first(mid))
      lo = mid;
    else
      hi = mid;
  }
  ans = 0;
  for (int i = 1; i <= n; i++) ans += min(lo, (long long)a[i]);
  vector<int> vv;
  for (i = 1; i <= n; i++) {
    if ((long long)a[i] <= lo) continue;
    if (ans + 1 <= k) {
      ans++;
      if (lo + 1 == (long long)a[i])
        continue;
      else
        vv.push_back(i);
    } else
      break;
  }
  for (; i <= n; i++) {
    if ((long long)a[i] <= lo) continue;
    printf("%d ", i);
  }
  for (i = 0; i < vv.size(); i++) printf("%d ", vv[i]);
  cout << endl;
  return 0;
}
