#include <bits/stdc++.h>
using namespace std;
int main() {
  set<pair<int, int> > line;
  int n;
  long long k;
  long long s = 0;
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    line.insert(make_pair(x, i));
    s += x;
  }
  if (s < k) {
    cout << -1 << endl;
    return 0;
  }
  long long passed = 0;
  while (!line.empty() && k >= line.size() * (line.begin()->first - passed)) {
    k -= (long long)line.size() * (line.begin()->first - passed);
    passed = line.begin()->first;
    while (!line.empty() && line.begin()->first <= passed)
      line.erase(line.begin());
  }
  if (line.empty()) return 0;
  passed += k / line.size();
  k %= line.size();
  vector<pair<int, int> > res;
  res.reserve(line.size());
  while (!line.empty()) {
    res.push_back(make_pair(line.begin()->second, line.begin()->first));
    line.erase(line.begin());
  }
  sort(res.begin(), res.end());
  for (int i = 0; i < k; ++i)
    if (res[i].second <= passed + 1) res[i].first = -1;
  for (int i = 0; i < res.size(); ++i)
    if (res[(k + i) % res.size()].first != -1)
      cout << res[(k + i) % res.size()].first + 1 << ' ';
  cout << endl;
  return 0;
}
