#include <bits/stdc++.h>
using namespace std;
long long k, n;
vector<long long> q;
bool isltk(long long t) {
  long long sum = 0;
  for (long long i = 0; i < q.size(); i++) sum += min(q[i], t);
  if (sum < k)
    return true;
  else
    return false;
}
int main(void) {
  long long sum = 0;
  cin >> n >> k;
  q.resize(n);
  for (long long i = 0; i < n; i++) {
    cin >> q[i];
    sum += q[i];
  }
  if (sum < k) {
    cout << -1 << '\n';
    return 0;
  }
  long long l = 0, r = 10e9 + 10, m;
  while (l < r - 1) {
    m = (l + r) / 2;
    if (isltk(m))
      l = m;
    else
      r = m;
  }
  queue<pair<long long, long long> > qu;
  for (long long i = 0; i < n; i++) {
    if (q[i] > l) qu.push(make_pair(q[i], i + 1));
    k -= min(q[i], l);
  }
  for (long long i = 0; i < k; i++) {
    if (qu.front().first > l + 1) qu.push(qu.front());
    qu.pop();
  }
  while (!qu.empty()) {
    cout << qu.front().second << ' ';
    qu.pop();
  }
  cout << '\n';
  return 0;
}
