#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, pos, n, cnt, sz, dummy;
  vector<int> ans;
  long long k, tot = 0, examine[100005], temp;
  scanf("%d %I64d", &n, &k);
  for (i = 0; i < n; ++i) {
    scanf("%I64d", &examine[i]);
    tot += examine[i];
  }
  if (tot < k)
    printf("-1\n");
  else if (tot == k)
    printf("\n");
  else {
    dummy = n;
    while (k > (long long)n) {
      temp = k / (long long)n;
      k = k % (long long)n;
      cnt = 0;
      for (i = 0; i < dummy; ++i) {
        if (examine[i] != 0) {
          if ((long long)examine[i] <= temp) {
            k += (long long)(temp - (long long)examine[i]);
            examine[i] = 0;
            ++cnt;
          } else
            examine[i] -= temp;
        }
      }
      n -= cnt;
    }
    pos = 0;
    if (k != 0) {
      while (k != 0) {
        if (examine[pos] > 0) {
          --examine[pos];
          --k;
        }
        ++pos;
      }
    }
    for (i = pos; i < dummy; ++i)
      if (examine[i] > 0) ans.push_back(i + 1);
    for (i = 0; i < pos; ++i)
      if (examine[i] > 0) ans.push_back(i + 1);
    sz = ans.size();
    for (i = 0; i < (sz - 1); ++i) printf("%d ", ans[i]);
    printf("%d\n", ans[sz - 1]);
  }
  return 0;
}
