#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  long long n, k;
  while (cin >> n >> k) {
    map<int, vector<int> > m;
    for (int i = (0); i < ((n)); ++i) {
      int t;
      cin >> t;
      m[t].push_back(i + 1);
    }
    int d = 0;
    while (k > 0 && !m.empty()) {
      if (k >= n * (m.begin()->first - d)) {
        k -= n * (m.begin()->first - d);
        n -= m.begin()->second.size();
        d = m.begin()->first;
        m.erase(m.begin());
      } else {
        d += k / n;
        k %= n;
        break;
      }
    }
    if (k > 0 && m.empty()) {
      cout << -1 << endl;
      continue;
    }
    vector<pair<int, int> > v;
    for (typeof((m).begin()) it = (m).begin(); it != (m).end(); ++it)
      for (int i = (0); i < ((it->second.size())); ++i)
        v.push_back(make_pair(it->second[i], it->first - d));
    sort((v).begin(), (v).end());
    vector<int> a(v.size(), 1);
    for (int i = (0); i < ((k)); ++i)
      if (v[i].second == 1) a[i] = 0;
    for (int i = (0); i < ((v.size())); ++i) {
      int p = (i + k) % v.size();
      if (a[p]) cout << v[(i + k) % v.size()].first << " ";
    }
    cout << endl;
  }
  return 0;
}
