#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
int n, b[100100], a[100100];
long long k;
queue<int> q;
int alive, cur = 0, val = 0;
bool is_alive(int ind) {
  if (cur >= n) return false;
  return val < a[ind];
}
int main() {
  scanf("%d %lld", &n, &k);
  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 = (int)2e9, x = 0;
  while (l <= r) {
    int mid = (l + r) >> 1;
    long long sum = 0;
    for (int i = 0; i < n; i++) {
      sum += min(mid, a[i]);
    }
    if (sum < k) {
      x = mid;
      l = mid + 1;
    } else
      r = mid - 1;
  }
  vector<int> deleted(n, 0);
  for (int i = 0; i < n; i++) k -= min(x, a[i]);
  for (int i = 0; i < n && k; i++) {
    a[i] = a[i] - min(a[i], x);
  }
  int i;
  for (i = 0; i < n && k; i++) {
    if (!a[i]) continue;
    a[i]--;
    k--;
  }
  bool space = false;
  for (int j = i; j < i + n; j++) {
    if (!a[j % n]) continue;
    if (space) printf(" ");
    space = true;
    printf("%d", j % n + 1);
  }
  printf("\n");
  return 0;
}
