#include <bits/stdc++.h>
using namespace std;
long long n, k, a[100010], c, t;
bool ok(long long x) {
  long long sum = 0;
  for (int i = 1; i <= n; i++) sum += min(a[i], x);
  if (sum <= k) {
    t = sum;
    return 1;
  }
  return 0;
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    c += a[i];
  }
  if (c < k) {
    cout << "-1";
    return 0;
  }
  if (c == k) return 0;
  long long l = 0, r = k, mid;
  while (l < r) {
    mid = (l + r + 1) / 2;
    if (ok(mid))
      l = mid;
    else
      r = mid - 1;
  }
  vector<long long> v;
  k -= t;
  for (int i = 1; i <= n; i++) {
    if (a[i] > l && k) {
      a[i] -= l + 1;
      if (a[i]) v.push_back(i);
      k--;
    } else if (a[i] > l)
      cout << i << " ";
  }
  if (v.size())
    for (int i = 0; i <= v.size() - 1; i++) cout << v[i] << " ";
  return 0;
}
