#include <bits/stdc++.h>
using namespace std;
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <class L, class R, class M>
ostream& operator<<(ostream& os, tuple<L, R, M> P) {
  return os << "(" << get<0>(P) << "," << get<1>(P) << "," << get<2>(P) << ")";
}
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
  os << "{ ";
  for (auto v : V) os << v << " ";
  return os << "}";
}
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const long long maxn = (long long)1e5 + 5;
const long double EPS = 1e-9;
const long long INF = (long long)1e18 + 9;
const long long mod = (long long)1e9 + 7;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k, sum = 0;
  cin >> n >> k;
  vector<long long> a(n);
  for (long long& x : a) cin >> x, sum += x;
  if (sum < k) return cout << "-1" << '\n', 0;
  long long L = 0, R = INF;
  while (L < R) {
    long long mid = (L + R + 1) >> 1;
    long long csum = 0;
    for (long long i = 0; i < n; i++) {
      csum += min(mid, a[i]);
    }
    if (csum <= k) {
      L = mid;
    } else {
      R = mid - 1;
    }
  }
  vector<long long> perm;
  for (long long i = 0; i < n; i++)
    if (a[i] > L) perm.push_back(i);
  for (long long i = 0; i < n; i++) k -= min(a[i], L);
  if (k == 0) {
    for (long long& x : perm) cout << x + 1 << " ";
    cout << '\n';
    return 0;
  }
  long long rem = k % (long long)perm.size();
  for (long long i = 0; i < n; i++) a[i] -= L + k / (long long)perm.size();
  deque<long long> dq(perm.begin(), perm.end());
  while (rem > 0 && !dq.empty()) {
    long long top = dq.front();
    dq.pop_front();
    a[top]--;
    if (a[top]) dq.push_back(top);
    rem--;
  }
  for (long long x : dq) cout << x + 1 << " ";
  cout << '\n';
  return 0;
}
