#include <bits/stdc++.h>
using namespace std;
struct stu {
  int a, b;
  bool operator<(const stu &t) const { return a < t.a; }
} arr[100001], brr[100001];
int crr[100001];
int main() {
  long long n;
  int i;
  long long k;
  long long all = 0;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    scanf("%d", &arr[i].a);
    arr[i].b = i + 1;
    crr[i] = arr[i].a;
    all = all + crr[i];
  }
  if (all < k) {
    printf("-1\n");
    return 0;
  }
  if (all == k) {
    printf("\n");
    return 0;
  }
  sort(crr, crr + n);
  int sum = 1, wei = 0;
  for (i = 1; i < n; i++) {
    if (crr[i] != crr[i - 1]) {
      brr[wei].a = crr[i - 1];
      brr[wei].b = sum;
      sum = 1;
      wei++;
    } else {
      sum++;
    }
  }
  brr[wei].a = crr[i - 1];
  brr[wei].b = sum;
  wei++;
  sort(brr, brr + wei);
  all = 0;
  long long st = 0;
  for (i = 0; i < wei; i++) {
    if (k < (n - all) * (brr[i].a - st)) break;
    k -= (n - all) * (brr[i].a - st);
    st = brr[i].a;
    all += brr[i].b;
  }
  int kw = 0;
  for (i = 0; i < n; i++) {
    if (arr[i].a > st) {
      arr[kw] = arr[i];
      kw++;
    }
  }
  int si = kw;
  long long se = k / kw;
  kw = k % kw;
  for (i = kw; i < si; i++) {
    printf("%d ", arr[i].b);
  }
  for (i = 0; i < kw; i++) {
    if (arr[i].a > se + st + 1) {
      printf("%d ", arr[i].b);
    }
  }
  printf("\n");
  return 0;
}
