#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > all;
int ara[100005], vis[100005], n;
long long func(int pos) {
  long long ret = 0;
  int i, pass;
  for (i = 0; i < n; i++) {
    pass = all[pos].first;
    if (i > all[pos].second) pass--;
    ret += min(pass, ara[i]);
  }
  return ret;
}
vector<int> answer;
int main() {
  int i;
  long long k;
  scanf("%d", &n);
  scanf("%I64d", &k);
  long long tot = 0;
  for (i = 0; i < n; i++) {
    scanf("%d", &ara[i]);
    all.push_back(make_pair(ara[i], i));
    tot += ara[i];
  }
  sort(all.begin(), all.end());
  if (k > tot) {
    printf("-1\n");
    return 0;
  }
  if (k == tot) {
    return 0;
  }
  int l = 0, r = n - 1, st;
  if (func(l) <= k) {
    while (r - l > 1) {
      int mid = (l + r) >> 1;
      if (func(mid) > k)
        r = mid;
      else
        l = mid;
    }
    k -= func(l);
    for (i = 0; i <= l; i++) vis[all[i].second] = 1;
    st = all[l].second;
    while (vis[st]) {
      st++;
      st %= n;
    }
  } else
    st = 0;
  for (i = 0; i < n; i++) {
    if (vis[(i + st) % n]) continue;
    answer.push_back((i + st) % n);
  }
  st = k % answer.size();
  for (i = 0; i < answer.size(); i++) {
    printf("%d ", answer[(i + st) % answer.size()] + 1);
  }
  printf("\n");
  return 0;
}
