#include <bits/stdc++.h>
using namespace std;
class Doctor {
  int n;
  long long k, m;
  int minx;
  bool check;
  int *a, *c;

 public:
  void ReadInpput() {
    cin >> n >> k;
    int so;
    a = new int[n + 2];
    c = new int[n + 2];
    for (int i = 0; i < n; i++) {
      cin >> so;
      a[i] = so;
      c[i] = so;
    }
    sort(c, c + n);
    m = n;
  }

 public:
  void DemLuot() {
    minx = 0;
    long long dem;
    check = true;
    int i = 0;
    while (i < n) {
      dem = c[i] - minx;
      if (dem * m <= k) {
        k -= dem * m;
        m--;
        minx = c[i];
        while ((i < n - 1) && (c[i] == c[i + 1])) {
          i++;
          m--;
        }
      } else {
        check = false;
        dem = k / m;
        minx += dem;
        k = k % m;
        break;
      }
      i++;
    }
  }

 public:
  void Xuat() {
    if (check && k > 0) {
      cout << "-1" << endl;
      return;
    }
    if (check && k == 0) {
      return;
    }
    int i = 0;
    check = false;
    while (k > 0) {
      while (a[i] <= minx && i < n) i++;
      k--;
      if (a[i] - minx == 1) check = true;
      i++;
    }
    if (check) {
      for (int j = i; j < n; j++)
        if (a[j] - minx == 1) a[j]++;
      minx++;
    }
    if (i >= n) i = 0;
    for (int j = 0; j < n; j++) {
      if (a[(i + j) % n] > minx) cout << (i + j) % n + 1 << " ";
    }
  }
};
int main() {
  Doctor Doli;
  Doli.ReadInpput();
  Doli.DemLuot();
  Doli.Xuat();
  return 0;
}
