#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  long long k;
  cin >> n >> k;
  vector<int> a(n);
  int M = 0;
  for (int _n(n), i(0); i < _n; i++) {
    cin >> a[i];
    M = max(M, a[i]);
  }
  int r1 = 0;
  int r2 = M;
  while (r1 < r2) {
    int r = (r1 + r2 + 1) / 2;
    long long c = 0;
    for (int _n(n), i(0); i < _n; i++) c += min(r, a[i]);
    if (c < k)
      r1 = r;
    else
      r2 = r - 1;
  }
  if (r2 == M)
    cout << -1 << endl;
  else {
    int r = r1;
    for (int _n(n), i(0); i < _n; i++) {
      k -= min(a[i], r);
      a[i] -= min(a[i], r);
    }
    int x = 0;
    while (k) {
      if (a[x]) {
        a[x]--;
        k--;
      }
      x++;
    }
    for (int _n(n), i(0); i < _n; i++)
      if (a[(x + i) % n]) printf("%d ", (x + i) % n + 1);
    printf("\n");
  }
  return 0;
}
