#include <bits/stdc++.h>
int n;
long long sum, k;
int ary[100010], sor[100010];
bool cmp(int a, int b) {
  return (ary[a] == ary[b]) ? (a < b) : (ary[a] < ary[b]);
}
int main(void) {
  scanf("%d%I64d", &n, &k);
  for (int i = 0; i < n; ++i) scanf("%d", &ary[i]), sor[i] = i, sum += ary[i];
  std::sort(sor, sor + n, cmp);
  if (sum > k) {
    int shi = 0, min, st;
    for (int i = 0; i < n; ++i) {
      if (i != 0 && ary[sor[i]] == ary[sor[i - 1]]) continue;
      int now = sor[i];
      long long t = (long long)(n - i) * (ary[now] - shi);
      if (t <= k)
        k -= t;
      else {
        min = shi + k / (n - i) + 1;
        k %= (n - i);
        break;
      }
      shi = ary[now];
    }
    for (int i = 0; i < n; ++i) {
      if (ary[i] >= min) --ary[i], --k;
      if (k < 0) {
        st = i;
        break;
      }
    }
    printf("%d ", st + 1);
    for (int i = (st + 1) % n; i != st;) {
      if (ary[i] >= min) printf("%d ", i + 1);
      i += (i + 1 == n) ? (-i) : 1;
    }
    puts("");
  } else if (sum < k)
    puts("-1");
  return 0;
}
