#include <bits/stdc++.h>
using namespace std;
long long n, k, sum = 0, vis;
int arr[200000];
int out[200000];
int tmp[200000], ptr = 0;
void f(int a) {
  ptr = 0;
  vis = 0;
  for (int i = 0; i < n; i++) {
    vis += min(a, arr[i]);
    if (arr[i] > a) tmp[ptr++] = i;
  }
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    scanf("%d", &arr[i]);
    sum += arr[i];
  }
  if (sum < k) {
    cout << -1 << endl;
    return 0;
  }
  int l = 0, r = 1000000000;
  while (l < r) {
    int mid = (l + r + 1) / 2;
    f(mid);
    if (vis <= k)
      l = mid;
    else
      r = mid - 1;
  }
  f(l);
  k -= vis;
  for (int i = k; i < ptr; i++) out[i - k] = tmp[i];
  int st = ptr - k;
  for (int i = 0; i < k; i++) {
    if (l + 1 != arr[tmp[i]]) out[st++] = tmp[i];
  }
  for (int i = 0; i < st; i++) {
    if (i) printf(" ");
    printf("%d", out[i] + 1);
  }
  cout << endl;
  return 0;
}
