#include <bits/stdc++.h>
using namespace std;
int i, j, n, a[100000];
long long ans, k, sum;
int main() {
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  if (sum < k) {
    cout << -1 << endl;
    exit(0);
  }
  long long P = 0, Q = 1000000000000000000LL, R, x;
  while (P < Q) {
    R = (P + Q) / 2;
    sum = 0;
    for (i = 0; i < n; i++) {
      x = R / n;
      if (i < R % n) x++;
      sum += min(x, (long long)a[i]);
    }
    if (sum >= k)
      Q = R;
    else
      P = R + 1;
  }
  for (long long i = P; i < P + n; i++) {
    x = P / n;
    if (i % n < P % n) x++;
    if (x < a[i % n]) printf("%d ", i % n + 1);
  }
  return 0;
}
