#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 5;
struct al {
  int ind, x;
} a[NMAX];
bool istaken[NMAX];
bool cmp(const al &p1, const al &p2) {
  if (p1.x == p2.x) return p1.ind < p2.ind;
  return p1.x < p2.x;
}
bool cmp2(const al &p1, const al &p2) { return p1.ind < p2.ind; }
int main() {
  long long N, K, i, j;
  cin >> N >> K;
  long long sum = 0;
  for (i = 1; i <= N; ++i) cin >> a[i].x, a[i].ind = i, sum += a[i].x;
  if (sum < K) {
    cout << -1;
    return 0;
  }
  sort(a + 1, a + N + 1, cmp);
  long long start = N + 1, k, u;
  long long val;
  for (i = 1; i <= N; ++i) {
    long long dif = a[i].x - a[i - 1].x;
    if (K < dif * (N - i + 1)) {
      long long cnt = 0, dist = N - i + 1;
      long long fact = K / dist;
      u = -1;
      val = a[i].x;
      sort(a + i, a + N + 1, cmp2);
      bool used = 0;
      for (j = i + (K % dist), k = i; k <= N; ++k, ++j) {
        if (j > N) j = i, used = 1;
        if (fact == dif - 1 && used && a[j].x == val) {
        } else
          cout << a[j].ind << " ";
      }
      return 0;
    } else
      K -= dif * (N - i + 1);
    if (K == 0) {
      j = i + 1;
      val = a[i].x;
      while (j <= N && a[j].x == val) {
        ++j;
      }
      sort(a + j, a + N + 1, cmp2);
      for (j; j <= N; ++j)
        if (a[j].x != val) cout << a[j].ind << " ";
      return 0;
    }
  }
  return 0;
}
