#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
const double PI = 2 * acos(0.0);
const double EPS = 1e-8;
const int INF = 1000000000;
int n;
long long k, lo, hi, mi;
int a[100000];
long long f(long long v) {
  long long res = 0;
  for (int i = (int)(0); i < (int)(n); ++i)
    if (a[i] < v)
      res += a[i];
    else
      res += v;
  return res;
};
int main() {
  cin >> n >> k;
  for (int i = (int)(0); i < (int)(n); ++i) scanf("%d", &a[i]);
  long long ss = 0;
  for (int i = (int)(0); i < (int)(n); ++i) ss += a[i];
  if (ss < k) {
    printf("-1");
    return 0;
  };
  lo = 0;
  hi = INF;
  while (hi - lo > 1) {
    mi = (lo + hi) / 2;
    if (f(mi) > k)
      hi = mi;
    else
      lo = mi;
  };
  k -= f(lo);
  for (int i = (int)(0); i < (int)(n); ++i)
    if (a[i] < lo)
      a[i] = 0;
    else
      a[i] -= lo;
  int i = 0;
  while (k) {
    if (a[i] == 0)
      ++i;
    else {
      --a[i];
      --k;
      ++i;
    };
  };
  for (int j = i; j < n; ++j)
    if (a[j]) printf("%d ", j + 1);
  for (int j = 0; j < i; ++j)
    if (a[j]) printf("%d ", j + 1);
  return 0;
};
