#include <bits/stdc++.h>
using namespace std;
long long n;
long long k, a[100001], b[100001];
void work() {
  int i, j, flag = 0;
  long long s = n, t, now = 0;
  for (i = 1; i <= n; i++) {
    t = s * (a[i] - now);
    if (t >= k) {
      now = now + k / s;
      k = k % s;
      i = 0;
      if (k != 0)
        for (i = 1; i <= n; i++)
          if (b[i] - now > 0) {
            b[i]--;
            k--;
            if (k < 1) break;
          }
      for (j = i + 1; j <= n; j++)
        if (b[j] > now) {
          if (flag == 0) {
            flag = 1;
            printf("%d", j);
          } else
            printf(" %d", j);
        }
      for (j = 1; j <= i; j++)
        if (b[j] > now) {
          if (flag == 0) {
            flag = 1;
            printf("%d", j);
          } else
            printf(" %d", j);
        }
      printf("\n");
      return;
    } else {
      s--;
      k = k - t;
      now = a[i];
    }
  }
}
void init() {
  int i;
  long long t = 0;
  for (i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    t += a[i];
    b[i] = a[i];
  }
  if (t < k) printf("-1\n");
  if (t == k) return;
  sort(a + 1, a + n + 1);
  work();
}
int main() {
  scanf("%d%I64d", &n, &k);
  init();
}
