#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
  long long n, k;
  cin >> n >> k;
  int *a = new int[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long p = n;
  queue<int> q;
  while (k && p) {
    long long m = k / p;
    if (m) {
      for (int i = 0; i < n; ++i) {
        if (a[i] && a[i] <= m) {
          k -= a[i];
          a[i] = 0;
          p--;
        } else if (a[i]) {
          k -= m;
          a[i] -= m;
        }
      }
    } else {
      int i = 0;
      while (k) {
        if (a[i]) {
          k--;
          if (a[i] > 1) q.push(i + 1);
          a[i] = 0;
        }
        i++;
      }
    }
  }
  if (k)
    cout << -1 << endl;
  else {
    for (int i = 0; i < n; i++) {
      if (a[i]) cout << i + 1 << " ";
    }
    while (q.size()) {
      cout << q.front() << " ";
      q.pop();
    }
  }
  return 0;
}
