#include <bits/stdc++.h>
using namespace std;
long long all[1000000];
long long N;
long long K;
map<long long, long long> cntr;
int main() {
  cin >> N >> K;
  long long dk = 0;
  for (long long i = 0; i < N; i++) {
    cin >> all[i];
    cntr[all[i]]++;
    dk += all[i];
  }
  if (K == 0) {
    for (long long i = 0; i < N; i++) cout << i + 1 << " ";
    cout << endl;
    return 0;
  }
  if (dk < K) {
    cout << -1 << endl;
    return 0;
  }
  long long sm = 0;
  for (map<long long, long long>::reverse_iterator i = cntr.rbegin();
       i != cntr.rend(); i++) {
    sm += i->second;
    i->second = sm;
  }
  sm = 0;
  long long zft = 0;
  long long bf = 0;
  long long bf2 = 0;
  long long iter, targetNum, iterSz, soso;
  for (map<long long, long long>::iterator i = cntr.begin(); i != cntr.end();
       i++) {
    long long tmp = i->second;
    sm += i->second * (i->first - zft);
    i->second = sm;
    zft = i->first;
    if (K > bf && K <= (i->second)) {
      iter = K - bf;
      targetNum = i->first;
      iterSz = tmp;
      soso = bf2;
      break;
    }
    bf = i->second;
    bf2 = i->first;
  }
  soso += (iter / iterSz);
  iter = iter % iterSz;
  vector<pair<int, int> > final;
  for (long long i = 0; i < N; i++) {
    if (all[i] < targetNum)
      all[i] = 0;
    else {
      all[i] -= soso;
      if (all[i]) final.push_back(make_pair(i + 1, all[i]));
    }
  }
  for (long long i = 0; i < iter; i++) {
    if (--final[i].second) {
      final.push_back(final[i]);
      final[i].second = 0;
    }
  }
  for (long long i = 0; i < final.size(); i++)
    if (final[i].second) {
      cout << final[i].first << " ";
    }
  cout << endl;
  return 0;
}
