#include <bits/stdc++.h>
using namespace std;
clock_t __START, __END;
double __TOTALTIME;
void _MS() { __START = clock(); }
void _ME() {
  __END = clock();
  __TOTALTIME = (double)(__END - __START) / CLOCKS_PER_SEC;
  cout << "Time: " << __TOTALTIME << " s" << endl;
}
const double E = 2.718281828;
const double PI = acos(-1.0);
const long long INF = (1LL << 60);
const int inf = (1 << 30);
const double ESP = 1e-8;
const int mod = (int)1e9 + 7;
const int N = (int)1e6 + 10;
map<long long, long long> mp;
long long cun[N], a[N], sum[N];
struct node {
  long long v, sum;
} p[N];
queue<long long> q;
signed main() {
  long long n, k;
  scanf("%lld%lld", &n, &k);
  long long SUM = 0;
  for (long long i = 1; i <= n; ++i)
    scanf("%lld", &a[i]), mp[a[i]]++, SUM += a[i];
  if (k > SUM) {
    printf("-1\n");
    return 0;
  }
  long long tot = 0;
  for (auto i : mp) {
    p[++tot].v = i.first;
    p[tot].sum = i.second;
  }
  for (long long i = tot; i >= 1; --i) sum[i] = sum[i + 1] + p[i].sum;
  long long rou = 0;
  for (long long i = 1; i <= tot; ++i) {
    if (k >= sum[i] * (p[i].v - p[i - 1].v))
      k -= sum[i] * (p[i].v - p[i - 1].v), rou += (p[i].v - p[i - 1].v);
    else {
      long long have = k / sum[i];
      k %= sum[i];
      rou += have;
      break;
    }
  }
  for (long long i = 1; i <= n; ++i) {
    a[i] -= rou;
    if (a[i] > 0) q.push(i);
  }
  while (k--) {
    long long x = q.front();
    q.pop();
    a[x]--;
    if (a[x] > 0) q.push(x);
  }
  bool ok = 0;
  while (!q.empty()) {
    long long x = q.front();
    q.pop();
    if (!ok)
      printf("%lld", x), ok = 1;
    else
      printf(" %lld", x);
  }
  printf("\n");
  return 0;
}
