#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  vector<int> a(n);
  vector<pair<int, int> > t(n);
  long long sum = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    t[i] = pair<int, int>(a[i], i);
    sum += a[i];
  }
  if (sum < k) {
    cout << -1 << endl;
    return 0;
  }
  if (sum == k) {
    cout << endl;
    return 0;
  }
  sort(t.begin(), t.end());
  int cur = 0;
  int past = 0;
  while (k >= (t[cur].first - past) * (n - cur)) {
    k -= (t[cur].first - past) * (n - cur);
    past = t[cur].first;
    ++cur;
  }
  long long k1 = k % (n - cur);
  past += k / (n - cur);
  vector<int> was(n, 1);
  vector<int> q;
  for (int i = 0; i < n; ++i) {
    if (i < cur) was[t[i].second] = 0;
  }
  for (int i = 0; i < n; ++i)
    if (was[i]) q.push_back(i);
  for (int i = k1; i < q.size(); ++i) printf("%d ", q[i] + 1);
  for (int i = 0; i < k1; ++i)
    if (a[q[i]] > past + 1) printf("%d ", q[i] + 1);
  cout << endl;
  return 0;
}
