#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  int t = 1;
  while (t--) solve();
}
long long n, a[100500], k;
map<long long, long long> m;
void solve() {
  cin >> n >> k;
  long long sum = 0;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    m[a[i]]++;
    sum += a[i];
  }
  if (sum < k) {
    cout << "-1";
    return;
  }
  if (sum == k) {
    cout << endl;
    return;
  }
  long long go = 0;
  long long prev = 0;
  long long now = n, last = n;
  for (map<long long, long long>::iterator i = m.begin(); i != m.end(); i++) {
    go += ((i->first) - prev) * now;
    prev = i->first;
    last = now;
    now -= (i->second);
    if (go >= k) break;
  }
  vector<long long> b(0);
  long long cnt = go - k;
  for (long long i = 0; i < n; i++)
    if (a[i] >= prev) b.push_back(i);
  long long mn = cnt / last;
  cnt %= last;
  for (long long i = b.size() - cnt; i < b.size(); i++) cout << b[i] + 1 << ' ';
  for (long long i = 0; i < b.size() - cnt; i++)
    if (a[b[i]] > prev - mn) cout << b[i] + 1 << ' ';
}
