#include <bits/stdc++.h>
using namespace std;
long long nxt() {
  long long a;
  cin >> a;
  return a;
}
int main() {
  cin.sync_with_stdio(0);
  int n = nxt();
  long long k = nxt();
  vector<long long> a(n);
  generate(a.begin(), a.end(), nxt);
  if (accumulate(a.begin(), a.end(), 0ll) < k) {
    cout << -1;
    return 0;
  }
  long long lo = 0, hi = 1e14 + 15;
  while (hi - lo > 1) {
    long long mid = (lo + hi) / 2;
    long long steps = 0;
    for (int i = 0; i < n; ++i) {
      steps += min(a[i], mid);
    }
    if (steps <= k)
      lo = mid;
    else
      hi = mid;
  }
  deque<int> ord;
  for (int i = 0; i < n; ++i) {
    k -= min(a[i], lo);
    a[i] = max(0ll, a[i] - lo);
    if (a[i] > 0) ord.push_back(i);
  }
  for (int i = 0; i < k; ++i) {
    int t = ord.front();
    ord.pop_front();
    a[t]--;
    if (a[t] > 0) ord.push_back(t);
  }
  for (int i : ord) cout << i + 1 << " ";
  return 0;
}
