#include <bits/stdc++.h>
using namespace std;
int main(int argc, char* argv[]) {
  int n;
  long long k;
  cin >> n >> k;
  int queue[100000];
  map<int, int> count;
  long long must = 0;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    queue[i] = a;
    if (!count.count(a)) count.insert(pair<int, int>(a, 0));
    count[a]++;
    must += a;
  }
  if (k < must) {
    long long sum = 0;
    long long delta = 0;
    int positiv = n;
    map<int, int>::iterator l = count.begin();
    delta = l->first - sum;
    while (delta * positiv < k) {
      k -= delta * positiv;
      positiv -= l->second;
      sum += delta;
      l++;
      delta = l->first - sum;
    }
    sum += k / positiv;
    int modulo = k % positiv;
    int position = 0;
    for (int i = 0; i < n; i++) {
      queue[i] -= sum;
      if ((modulo > 0) && (queue[i] > 0)) {
        queue[i]--;
        modulo--;
        if (modulo == 0) {
          position = i + 1;
          modulo--;
        }
      }
    }
    for (int i = 0; i < n; i++) {
      if (queue[(i + position) % n] > 0) cout << (i + position) % n + 1 << " ";
    }
  } else if (k > must)
    cout << -1;
  return 0;
}
