#include <bits/stdc++.h>
using namespace std;
const int oo = (int)1e9, MAXN = (int)1e6;
bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second < b.second;
}
int n;
long long k, cumul = 0;
set<pair<int, int> > test;
int main() {
  cin >> n >> k;
  int val;
  for (int i = 0; i < (n); i++) {
    cin >> val;
    test.insert(make_pair(val, i + 1));
  }
  while (test.size() && k >= ((long long)(test.begin()->first) - cumul) *
                                 ((long long)(test.size()))) {
    k -=
        ((long long)(test.begin()->first) - cumul) * ((long long)(test.size()));
    cumul = (long long)(test.begin()->first);
    test.erase(test.begin());
  }
  if (!test.size() && k)
    cout << -1 << endl;
  else if (!test.size())
    cout << endl;
  else {
    cumul += (k / test.size());
    k = k % test.size();
    vector<pair<int, int> > num((test).begin(), (test).end());
    sort((num).begin(), (num).end(), cmp);
    for (int i = 0; i < (num.size()); i++) {
      if (i + k >= num.size() && num[(i + k) % num.size()].first <= cumul + 1)
        continue;
      cout << num[((long long)i + k) % num.size()].second << ' ';
    }
  }
  return 0;
}
