#include <bits/stdc++.h>
using namespace std;
long long N, K;
long long ip[123456];
bool chok(long long mid) {
  long long t = 0;
  for (int i = 0; i < N; i++) {
    t += min(mid, ip[i]);
  }
  if (t > K) {
    return false;
  }
  return true;
}
void mnd(long long a) {
  long long t = 0;
  for (int i = 0; i < N; i++) {
    t += min(a, ip[i]);
    ip[i] -= min(a, ip[i]);
  }
  K -= t;
}
int main() {
  scanf("%I64d%I64d", &N, &K);
  long long mx = 0, mn = 0, mid, tot = 0;
  for (int i = 0; i < N; i++) {
    scanf("%I64d", ip + i);
    if (mx < ip[i]) {
      mx = ip[i];
    }
    tot += ip[i];
  }
  if (tot < K) {
    puts("-1");
    return 0;
  }
  while (mx > mn) {
    mid = (mx + mn + 1) / 2;
    if (chok(mid)) {
      mn = mid;
    } else {
      mx = mid - 1;
    }
  }
  mnd(mn);
  int st = 0;
  while (K) {
    if (ip[st] > 0) {
      ip[st]--;
      K--;
    }
    st++;
  }
  bool isf = 1;
  for (int i = st; i != st + N; i++) {
    if (ip[i % N] > 0) {
      if (isf) {
        isf = 0;
      } else {
        printf(" ");
      }
      printf("%d", (i % N) + 1);
    }
  }
}
