#include <bits/stdc++.h>
using namespace std;
int n;
long long times[105000], sortTime[105000], output[105000];
long long k;
int cmp(const void *aa, const void *bb) {
  int *a = (int *)aa, *b = (int *)bb;
  return (*a) - (*b);
}
int main() {
  long long sum = 0;
  scanf("%d%I64d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%I64d", &times[i]);
    sortTime[i] = times[i];
    sum += times[i];
  }
  if (sum == k) {
    printf("\n");
    return 0;
  } else if (sum < k) {
    printf("-1\n");
    return 0;
  }
  if (k == 0) {
    for (int i = 1; i <= n; i++) {
      if (i > 1) printf(" ");
      printf("%d", i);
    }
    printf("\n");
    return 0;
  }
  qsort(sortTime, n, sizeof(long long), cmp);
  long long now = 0, n1 = n, t = 0, pre = 0;
  while (now + (sortTime[t] - pre) * n1 < k) {
    now += (sortTime[t] - pre) * n1;
    pre = sortTime[t];
    while (sortTime[t + 1] == sortTime[t] && t < n) t++, n1--;
    t++, n1--;
    if (t == n) break;
  }
  long long left = k - now, leftTime = (k - now) / n1, start, outn = 0;
  bool first = true;
  start = left - leftTime * n1;
  for (int i = 0; i < n; i++)
    if (times[i] >= sortTime[t]) output[outn++] = i + 1;
  for (int i = start; i < outn; i++)
    if (leftTime < times[output[i] - 1] - pre) {
      if (!first) printf(" ");
      first = false;
      printf("%d", output[i]);
    }
  for (int i = 0; i < start; i++)
    if (leftTime < times[output[i] - 1] - pre) {
      if (leftTime + 1 == sortTime[t] - pre &&
          times[output[i] - 1] > sortTime[t]) {
        if (!first) printf(" ");
        first = false;
        printf("%d", output[i]);
      } else if (leftTime + 1 < sortTime[t] - pre) {
        if (!first) printf(" ");
        first = false;
        printf("%d", output[i]);
      }
    }
  printf("\n");
  return 0;
}
