#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int A[maxn];
int n;
int B[maxn];
long long K;
int main() {
  cin >> n >> K;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
    B[i] = A[i];
  }
  sort(B, B + n);
  long long turn = 0;
  int remv = 0;
  for (remv = 0; remv < n; remv++) {
    if (turn < B[remv]) {
      if (K < n - remv) break;
      if ((long long)(B[remv] - turn) * (n - remv) <= K) {
        K -= (long long)(B[remv] - turn) * (n - remv);
        turn = B[remv];
      } else {
        turn += K / (n - remv);
        K %= (n - remv);
      }
    }
  }
  for (int i = 0; i < n; i++) {
    A[i] -= turn;
    if (A[i] < 0) A[i] = 0;
  }
  int p = -1, m = 0;
  for (int i = 0; i < n; i++) {
    if (A[i] != 0) {
      if (K > 0) {
        K--;
        A[i]--;
        if (A[i] != 0) p = i;
      } else
        break;
    }
  }
  for (int i = 0; i < n; i++)
    if (A[i] != 0) m++;
  if (K > 0) {
    cout << -1 << endl;
  } else {
    int ws = 0;
    int cur = p;
    for (int i = 0; i < m; i++) {
      cur++;
      if (cur >= n) cur -= n;
      while (A[cur] == 0) {
        cur++;
        if (cur >= n) cur -= n;
      }
      ws&& cout << ' ';
      cout << cur + 1;
      ws = 1;
    }
    cout << endl;
  }
  return 0;
}
