#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N];
int n;
long long solve(int m) {
  long long res = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] >= m)
      res += m;
    else
      res += a[i];
  }
  return res;
}
int main() {
  long long k;
  scanf("%d %I64d", &n, &k);
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  if (sum < k) {
    printf("-1\n");
    return 0;
  }
  int l = 1, r = 1e9;
  while (l < r) {
    int m = (l + r) / 2;
    if (solve(m) < k)
      l = m + 1;
    else
      r = m;
  }
  l -= 1;
  long long req = 0;
  deque<int> Q;
  for (int i = 0; i < n; i++) {
    if (a[i] <= l) {
      req += a[i];
      a[i] = 0;
    } else {
      req += l;
      a[i] -= l;
      Q.push_back(i);
    }
  }
  req = k - req;
  while (req > 0) {
    int x = Q.front();
    Q.pop_front();
    a[x] -= 1;
    if (a[x] > 0) Q.push_back(x);
    req--;
  }
  while (!Q.empty()) {
    int x = Q.front();
    Q.pop_front();
    printf("%d ", x + 1);
  }
  printf("\n");
  return 0;
}
