#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-9;
int main() {
  int n;
  long long k;
  cin >> n >> k;
  vector<int> a(n);
  long long sum = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  if (sum < k) {
    cout << -1 << endl;
    return 0;
  }
  int l = 0, r = 1000000200;
  while (l + 1 < r) {
    int m = (l + r) / 2;
    long long sum = 0;
    for (int i = 0; i < n; ++i) sum += min(m, a[i]);
    if (sum <= k)
      l = m;
    else
      r = m;
  }
  for (int i = 0; i < n; ++i) {
    k -= min(a[i], l);
    a[i] = max(0, a[i] - l);
  }
  deque<int> z;
  for (int i = 0; i < n; ++i)
    if (a[i] > 0) z.push_back(i);
  for (int i = 0; i < k; ++i) {
    int idx = z.front();
    z.pop_front();
    a[idx]--;
    if (a[idx] > 0) z.push_back(idx);
  }
  for (int i = 0; i < z.size(); ++i) {
    if (i) printf(" ");
    printf("%d", z[i] + 1);
  }
  printf("\n");
  return 0;
}
