#include <bits/stdc++.h>
using namespace std;
const long long INF = 100000000001111ll;
long long f[100086];
long long m, n;
inline long long gao(long long x) {
  long long i, j, k;
  long long ret(0);
  for (i = 0; i < n; ++i) ret += min(x, f[i]);
  return ret;
}
int main() {
  long long i, j, k, t, r, tt;
  long long left, right, mid;
  long long sum;
  long long ll, hh;
  long long tot(0);
  long long p;
  ll = INF, hh = -INF;
  cin >> n >> k;
  for (i = 0; i < n; ++i) cin >> f[i], tot += f[i];
  if (n == 0) {
    puts("");
  } else if (tot < k) {
    puts("-1");
  } else if (tot == k) {
    puts("");
  } else {
    left = 0, right = INF;
    while (left <= right) {
      mid = (left + right) >> 1;
      sum = gao(mid);
      if (sum == k) break;
      if (sum < k)
        left = mid + 1;
      else
        right = mid - 1;
    }
    if (sum == k) {
      for (i = 0; i < n; ++i) f[i] -= min(f[i], mid);
      for (j = n - 1; j >= 0; --j)
        if (f[j] > 0) break;
      i = 0;
    } else {
      for (r = -2; r <= 2; ++r) {
        tt = max(0ll, r + left);
        if (gao(tt) > k) break;
      }
      left = tt - 1;
      sum = gao(left);
      for (i = 0; i < n; ++i) f[i] -= min(f[i], left);
      p = k - sum;
      for (i = 0; i < n; ++i) {
        if (p > 0 && f[i] > 0) --f[i], --p;
        if (p == 0) break;
      }
      i = i == n - 1 ? 0 : i + 1;
      int cnt = 0;
      for (t = i; cnt < n; ++cnt, t = t == n - 1 ? 0 : t + 1)
        if (f[t] > 0) j = t;
    }
    for (; i != j; i = i == n - 1 ? 0 : i + 1)
      if (f[i] > 0) cout << i + 1 << " ";
    cout << j + 1 << endl;
  }
  return 0;
}
