#include <bits/stdc++.h>
using namespace std;
long long lv;
int now, m, heap[100050];
int n, a[100050];
void heapify(int k) {
  int l, r, idx;
  l = k * 2;
  r = l + 1;
  if (l <= m && a[heap[l]] < a[heap[k]])
    idx = l;
  else
    idx = k;
  if (r <= m && a[heap[r]] < a[heap[idx]]) idx = r;
  if (idx ^ k) {
    swap(heap[idx], heap[k]);
    heapify(idx);
  }
}
void solve() {
  long long tmp;
  int pos;
  now = 0;
  m = n;
  for (int i = 1; i <= n; i++) heap[i] = i;
  for (int i = m; i > 0; i--) heapify(i);
  while (m && lv) {
    tmp = lv / m;
    if (!tmp) break;
    if (tmp > a[heap[1]] - now) tmp = a[heap[1]] - now;
    now += tmp;
    lv -= m * tmp;
    while (m && a[heap[1]] == now) {
      heap[1] = heap[m--];
      if (m > 1) heapify(1);
    }
  }
  if (!m && lv) {
    printf("-1\n");
    return;
  }
  if (!m && !lv) return;
  for (int i = 1; i <= n; i++)
    if (a[i] <= now)
      a[i] = 0;
    else
      a[i] -= now;
  pos = 1;
  while (lv) {
    if (a[pos]) {
      a[pos]--;
      lv--;
    }
    pos++;
  }
  for (int i = pos; i <= n; i++)
    if (a[i]) printf("%d ", i);
  for (int i = 1; i < pos; i++)
    if (a[i]) printf("%d ", i);
  printf("\n");
}
int main() {
  while (scanf("%d", &n) != EOF) {
    cin >> lv;
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    solve();
  }
  return 0;
}
