#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:10000000")
using namespace std;
long long n, a[100005], k, b[100005], g = 0;
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    b[i] = a[i];
    g += a[i];
  }
  if (g < k) {
    cout << -1;
    return 0;
  }
  if (g == k) {
    return 0;
  }
  stable_sort(b + 1, b + n + 1);
  long long sum = 0, now = 1, gone = 0;
  while (sum + (n - gone) * (b[now] - b[now - 1]) <= k) {
    sum += (n - gone) * (b[now] - b[now - 1]);
    long long t = now;
    now++;
    while (now <= n && b[now] == b[now - 1]) now++;
    gone += now - t;
  }
  long long delta = (k - sum) % (n - gone);
  long long start = 0, got = 0;
  while (got != delta) {
    start++;
    if (a[start] >= b[now]) got++;
  }
  if (k > sum + (n - gone) * (b[now] - b[now - 1] - 1)) {
    long long d = k - sum - (n - gone) * (b[now] - b[now - 1] - 1);
    long long e = 1, gt = 0;
    while (gt != d) {
      if (a[e] > b[now]) {
        gt++;
      } else if (a[e] == b[now]) {
        gt++;
        a[e] = 0;
      }
      e++;
    }
  }
  for (int i = start + 1; i <= n; i++) {
    if (a[i] >= b[now]) cout << i << " ";
  }
  for (int i = 1; i <= start; i++) {
    if (a[i] >= b[now]) cout << i << " ";
  }
  return 0;
}
