#include <bits/stdc++.h>
using namespace std;
queue<int> q;
long long a[100005], k, sum;
int main() {
  int n;
  scanf("%d%lld", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
    q.push(i);
  }
  if (sum < k) {
    printf("-1\n");
    return 0;
  }
  if (sum == k) return 0;
  int cnt = n, p = 0;
  while (cnt != p) {
    p = cnt, cnt = 0;
    long long ave = k / p;
    for (int i = 1; i <= p; i++) {
      int tp = q.front();
      q.pop();
      if (a[tp] > ave) {
        cnt++;
        q.push(tp);
      } else
        k -= a[tp];
    }
  }
  p = k / cnt, k %= cnt;
  while (k--) {
    int tp = q.front();
    q.pop();
    if (a[tp] > p + 1) q.push(tp);
  }
  cout << q.front();
  q.pop();
  while (!q.empty()) {
    cout << " " << q.front();
    q.pop();
  }
}
