#include <bits/stdc++.h>
const int N = 100005;
using namespace std;
long long ar[N], n, k, sm = 0;
long long R = 0;
bool can(long long r) {
  long long lef = k;
  for (int i = 1; i <= n; i++) {
    lef -= min(ar[i], r);
  }
  R = lef;
  return lef >= 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
    sm += ar[i];
  }
  if (k > sm) {
    cout << -1 << endl;
    return 0;
  } else if (k == sm) {
    cout << endl;
    return 0;
  }
  long long l = 0, r = 1000 * 1000 * 1000 + 7, ans = -1;
  while (l <= r) {
    long long m = (l + r) / 2;
    if (can(m)) {
      ans = m;
      l = m + 1;
    } else {
      r = m - 1;
    }
  }
  can(ans);
  int fir = n;
  for (int i = 1; i <= n; i++) {
    if (ar[i] > ans) {
      R--;
      if (R <= -1) {
        cout << i << ' ';
        fir = min(fir, i);
      }
    }
  }
  for (int i = 1; i < fir; i++) {
    if (ar[i] - 1 > ans) {
      cout << i << ' ';
    }
  }
  return 0;
}
