#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 9;
long long arr[MAXN], N, K;
long long Count(long long X) {
  long long cnt = 0;
  for (int k = 0; k < N; ++k) cnt += min(arr[k], X);
  return cnt;
}
long long BusBin() {
  long long ini = 1LL, fin = 1000000000LL, mid, ans;
  while (ini <= fin) {
    mid = (ini + fin) >> 1;
    if (Count(mid) >= K) {
      ans = mid;
      fin = mid - 1;
    } else
      ini = mid + 1;
  }
  return ans;
}
int main() {
  scanf("%I64d %I64d", &N, &K);
  long long sum = 0;
  for (int i = 0; i < N; ++i) {
    scanf("%I64d", &arr[i]);
    sum += arr[i];
  }
  if (K > sum) {
    printf("-1\n");
    return 0;
  }
  if (sum == K) {
    printf("\n");
    return 0;
  }
  if (K == 0) {
    for (int i = 0; i < N; ++i) printf("%d ", i + 1);
    printf("\n");
    return 0;
  }
  long long aum = BusBin();
  if (Count(aum) == K) {
    for (int i = 0; i < N; ++i) arr[i] = max(0LL, arr[i] - aum);
    for (int i = 0; i < N; ++i)
      if (arr[i]) printf("%d ", i + 1);
    return 0;
  }
  aum--;
  long long sumaux = 0LL;
  for (int i = 0; i < N; ++i) {
    sumaux += min(arr[i], aum);
    arr[i] = max(0LL, arr[i] - aum);
  }
  sumaux = K - sumaux;
  int i = 0;
  while (sumaux) {
    for (i = 0; i < N; ++i) {
      if (arr[i]) {
        arr[i]--;
        sumaux--;
        if (sumaux == 0) break;
      }
    }
  }
  int j = -1;
  i = (i + 1) % N;
  while (i != j) {
    if (arr[i]) printf("%d ", i + 1);
    if (j == -1) j = i;
    i = (i + 1) % N;
  }
  printf("\n");
  return 0;
}
