#include <bits/stdc++.h>
const int magicconst = 73743071;
using namespace std;
const int maxn = 100050;
pair<int, int> a[maxn];
bool b[maxn];
int ans[maxn];
int t = 0;
int inv[maxn];
int main() {
  int n;
  scanf("%d", &n);
  long long k;
  scanf("%I64d", &k);
  long long s = 0;
  for (int i = 0; i < (int)(n); ++i) {
    int q;
    scanf("%d", &q);
    s += q;
    a[i].first = q;
    a[i].second = i;
  }
  sort(a, a + n);
  for (int i = 0; i < (int)(n); ++i) inv[a[i].second] = i;
  if (k > s) printf("-1");
  if (k >= s) return 0;
  int i = 0;
  long long cnt = n;
  int t = 0;
  while (k >= a[i].first * cnt) {
    b[a[i].second] = 1;
    k -= a[i].first * cnt;
    t += a[i].first;
    a[i].first = 0;
    i++;
    a[i].first -= t;
    cnt--;
  }
  for (int j = i + 1; j < (int)(n); ++j) a[j].first -= t;
  t = 0;
  for (int j = 0; j < (int)(n); ++j)
    if (!b[j]) ans[t++] = j + 1;
  if (k <= (a[i].first - 1) * cnt) {
    for (int j = 0; j < (int)(t); ++j) printf("%d ", ans[(j + k) % t]);
  } else {
    int cur = k % t;
    for (int j = 0; j < (int)(cur); ++j) {
      if (k > (a[inv[ans[j] - 1]].first - 1) * cnt) b[ans[j] - 1] = 1;
    }
    for (int j = 0; j < (int)(t); ++j) {
      if (!b[ans[cur] - 1]) printf("%d ", ans[cur]);
      cur = (cur + 1) % t;
    }
  }
  return 0;
}
