#include <bits/stdc++.h>
using namespace std;
long long A[110000], as[110000];
int N;
long long K;
int main() {
  int i;
  scanf("%d%I64d", &N, &K);
  for (i = 0; i < N; ++i) {
    scanf("%I64d", A + i);
  }
  for (i = 0; i < N; ++i) as[i] = A[i];
  sort(as, as + N);
  long long d = 0;
  for (i = 0; i < N; ++i) {
    if (K > (as[i] - d) * (N - i)) {
      K -= (as[i] - d) * (N - i);
      d = as[i];
    } else {
      break;
    }
  }
  if (i == N) {
    printf("-1\n");
    return 0;
  }
  d += K / (N - i);
  K %= N - i;
  queue<int> q;
  for (i = 0; i < N; ++i) {
    if (A[i] > d) {
      q.push(i);
    }
  }
  while (K--) {
    i = q.front();
    q.pop();
    if (A[i] > d + 1) {
      q.push(i);
    }
  }
  int out = 0;
  while (!q.empty()) {
    if (out++) printf(" ");
    printf("%d", q.front() + 1);
    q.pop();
  }
  puts("");
  return 0;
}
