#include <bits/stdc++.h>
using namespace std;
pair<int, int> g[(200000)];
int f[(200000)];
int n;
long long m;
int main() {
  scanf("%d%I64d", &n, &m);
  long long sum = 0ll;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &f[i]);
    g[i] = make_pair(f[i], i);
    sum += (long long)f[i];
  }
  if (sum < m) {
    puts("-1");
    return 0;
  }
  if (sum == m) return 0;
  sort(g + 1, g + 1 + n);
  vector<int> ans;
  for (int k = 1, last = 0; k <= n;) {
    int now = g[k].first;
    long long tot = (long long)(n - k + 1), step = (long long)(now - last);
    long long cnt = step * tot;
    if (cnt > m) {
      int times = last + (int)(m / tot);
      int rest = (int)(m % tot), pos = -1;
      for (int i = 1, x = 0; i <= n; ++i)
        if (f[i] > last) {
          if (x++ >= rest) {
            pos = i;
            break;
          }
        }
      for (int i = pos; i <= n; ++i)
        if (f[i] > times) ans.push_back(i);
      for (int i = 1; i < pos; ++i)
        if (f[i] > times + 1) ans.push_back(i);
      break;
    }
    last = now, m -= cnt;
    for (; k <= n && g[k].first == now; ++k)
      ;
  }
  for (int i = 0; i < ans.size(); ++i)
    printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
  return 0;
}
