#include <bits/stdc++.h>
using namespace std;
int n;
pair<int, int> m[100100];
long long need;
int main() {
  cin >> n >> need;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    m[i] = make_pair(t, i + 1);
  }
  while (need >= n && n > 0) {
    int d = need / n;
    int l = 0;
    for (int i = 0; i < n; i++) {
      need -= min(m[i].first, d);
      m[i].first -= d;
      m[l] = m[i];
      if (m[l].first > 0) l++;
    }
    n = l;
  }
  if (n == 0 && need > 0)
    cout << -1;
  else {
    for (int i = need; i < n; i++) cout << m[i].second << " ";
    for (int i = 0; i < need; i++)
      if (m[i].first > 1) cout << m[i].second << " ";
  }
exit:
  return (0);
}
