#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long k;
  cin >> k;
  vector<int> a(n);
  for (int& x : a) scanf("%d", &x);
  long long Sum = 0;
  for (int x : a) Sum += x;
  if (Sum < k) return 0 * puts("-1");
  int Can = 0;
  int Low = 0, High = *max_element(a.begin(), a.end());
  while (Low <= High) {
    int Mid = Low + (High - Low) / 2;
    long long Sum = 0;
    for (int x : a) Sum += min(x, Mid);
    if (Sum <= k) {
      Can = Mid;
      Low = Mid + 1;
    } else {
      High = Mid - 1;
    }
  }
  for (int& x : a) {
    k -= min(x, Can);
    x = max(0, x - Can);
  }
  queue<int> Ans;
  for (int i = 0; i < n; i++)
    if (a[i] > 0) Ans.push(i);
  while (k > 0) {
    k--;
    if (--a[Ans.front()] > 0) Ans.push(Ans.front());
    Ans.pop();
  }
  while (!Ans.empty()) {
    printf("%d ", Ans.front() + 1);
    Ans.pop();
  }
  puts("");
}
