#include <bits/stdc++.h>
using namespace std;
signed main() {
  long long n, k;
  scanf("%lld %lld", &n, &k);
  long long A[n];
  for (long long i = 0; i < n; i++) scanf("%lld", &A[i]);
  map<long long, long long> M;
  priority_queue<long long> q;
  long long sum = 0;
  for (long long i = 0; i < n; i++) {
    if (!M[A[i]]) q.push(-A[i]);
    M[A[i]]++;
    sum += A[i];
  }
  if (sum == k) {
    printf("\n");
    return 0;
  }
  long long cnt = n, W = 0;
  sum = 0;
  while (!q.empty()) {
    long long t = -q.top();
    if (sum + (t - W) * cnt <= k) {
      sum += (t - W) * cnt;
      q.pop();
      cnt -= M[t];
      W = t;
      continue;
    }
    long long R = (k - sum) % cnt;
    long long T = (k - sum) / cnt;
    queue<long long> Q;
    for (long long i = 0; i < n; i++)
      if (A[i] >= t) Q.push(i);
    for (long long i = 0; i < R; i++) {
      if (A[Q.front()] - W - T > 1) Q.push(Q.front());
      Q.pop();
    }
    while (!Q.empty()) {
      printf("%lld ", Q.front() + 1);
      Q.pop();
    }
    return 0;
  }
  printf("-1\n");
  return 0;
}
