#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  long long k;
  cin >> n >> k;
  vector<int> a(n);
  long long ttt = 0;
  for (int i = (0); i < (n); ++i) {
    scanf("%d", &a[i]);
    ttt += a[i];
  }
  if (ttt < k) {
    cout << "-1\n";
    return 0;
  }
  if (ttt == k) return 0;
  int l = 0, r = 1000000000;
  while (abs(l - r) > 1) {
    int v = (l + r) / 2;
    long long q = 0;
    for (int i = (0); i < (n); ++i) q += min(a[i], v);
    if (q > k)
      r = v;
    else
      l = v;
  }
  int dx = l;
  long long sumq = 0;
  for (int i = (0); i < (n); ++i) sumq += min(a[i], r);
  if (sumq <= k) dx = r;
  vector<pair<int, int> > b;
  sumq = 0;
  for (int i = (0); i < (n); ++i) {
    sumq += min(dx, a[i]);
    a[i] -= dx;
    if (a[i] > 0) b.push_back(make_pair(a[i], i));
  }
  k -= sumq;
  int it = 0;
  while (k != 0) {
    b[it].first--;
    k--;
    if (b[it].first > 0) b.push_back(b[it]);
    it++;
  }
  cout << b[it].second + 1;
  for (int i = (it + 1); i < (int((b).size())); ++i) {
    cout << " " << b[i].second + 1;
  }
  cout << endl;
  return 0;
}
