#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int inf = 50000000;
const int maxn = 100010;
int arr[maxn];
queue<pair<int, int> > q;
map<int, int> m1;
int main() {
  int n, i, j;
  long long k, temp, cs, cur, sub;
  scanf("%d%lld", &n, &k);
  for (i = 1; i <= n; i++) {
    scanf("%d", &arr[i]);
    m1[arr[i]]++;
  }
  cs = n;
  sub = 0;
  for (auto it : m1) {
    cur = it.first - sub;
    temp = cs;
    temp = temp * cur;
    if (temp <= k) {
      k -= temp;
      cs = cs - (it.second);
      sub = it.first;
    } else
      break;
  }
  if (!cs) {
    if (k > 0) printf("-1\n");
    return 0;
  }
  cur = k / cs;
  temp = cs;
  temp = cs * cur;
  k -= temp;
  for (i = 1; i <= n; i++) {
    if (arr[i] > sub)
      arr[i] = arr[i] - sub - cur;
    else
      arr[i] = 0;
  }
  for (i = 1; i <= n; i++) {
    if (arr[i] > 0) q.push(make_pair(i, arr[i]));
  }
  while (k--) {
    pair<int, int> x = q.front();
    q.pop();
    x.second--;
    if (x.second) q.push(x);
  }
  if (q.empty()) {
    if (k > 0) printf("-1\n");
    return 0;
  }
  while (!q.empty()) {
    pair<int, int> x = q.front();
    q.pop();
    printf("%d ", x.first);
  }
  return 0;
}
