#include <bits/stdc++.h>
using namespace std;
int N, a[100005], b[100005];
long long K;
int main() {
  cin >> N >> K;
  for (int i = 1; i <= N; ++i) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(b + 1, b + 1 + N);
  int numLoops = 0, idx = -1;
  for (int i = 1; i <= N; ++i) {
    long long loop = b[i] - numLoops;
    if (loop == 0) continue;
    if (loop * (N - i + 1) >= K) {
      int div = (K - 1) / (N - i + 1) + 1;
      K %= (N - i + 1);
      if (K == 0) K = (N - i + 1);
      for (int j = 1; j <= N; ++j) {
        if (a[j] < b[i])
          a[j] = -1;
        else {
          if (K > 0) {
            a[j] -= numLoops + div;
            --K;
            if (K == 0) {
              idx = j + 1;
              if (idx > N) idx = 1;
            }
          }
        }
      }
      break;
    }
    K -= loop * (N - i + 1);
    numLoops += (int)loop;
  }
  if (idx == -1) {
    printf("%d\n", -1);
    return 0;
  }
  for (int i = 1; i <= N; ++i) {
    if (a[idx] > 0) printf("%d ", idx);
    ++idx;
    if (idx > N) idx = 1;
  }
  printf("\n");
  return 0;
}
