#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
long long a[100050], n, k;
bool ok(long long x) {
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    sum += min(x, a[i]);
  }
  if (sum >= k)
    return 1;
  else
    return 0;
}
int main() {
  n = read();
  k = read();
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    a[i] = read();
    sum += a[i];
  }
  if (sum == k) {
    return 0;
  }
  if (sum < k) {
    printf("-1\n");
    return 0;
  }
  long long l = 0, r = sum;
  while (l <= r) {
    long long mid = (l + r) >> 1;
    if (ok(mid)) {
      r = mid - 1;
    } else {
      l = mid + 1;
    }
  }
  sum = 0;
  for (int i = 0; i < n; i++) {
    sum += min(r, a[i]);
  }
  long long yu = k - sum, tmp = 0;
  bool flag = 1;
  for (int i = 0; i < n; i++) {
    a[i] -= min(r, a[i]);
    if (a[i]) {
      if (yu == 0 && flag) {
        tmp = i;
        flag = 0;
      }
      if (yu > 0) {
        yu--;
        a[i]--;
      }
    }
  }
  for (int i = tmp; i < n; i++) {
    if (a[i]) printf("%d ", i + 1);
  }
  for (int i = 0; i < tmp; i++) {
    if (a[i]) printf("%d ", i + 1);
  }
  printf("\n");
  return 0;
}
