#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
const long long inf = 1e15;
int N;
long long K;
int a[MAXN];
int main() {
  scanf("%d%I64d", &N, &K);
  long long sum = 0;
  for (int i = 0; i < N; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  if (sum < K) {
    puts("-1");
    return 0;
  }
  long long lo = 0, hi = inf;
  while (lo != hi) {
    long long mi = (lo + hi + 1) / 2;
    long long left = 0;
    for (int i = 0; i < N; i++)
      left += min((long long)a[i], mi / N + (i < mi % N));
    if (left <= K) {
      lo = mi;
    } else {
      hi = mi - 1;
    }
  }
  for (long long x = lo; x < lo + N; x++) {
    if (x / N + 1 <= a[x % N]) printf("%d ", x % N + 1);
  }
  puts("");
}
