#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110000;
int a[MAXN], b[MAXN];
int n;
long long k;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  sort(b, b + n);
  for (int i = n - 1; i > 0; i--) b[i] -= b[i - 1];
  long long cnt = 0;
  vector<int> ans;
  for (int i = 0; i < n; i++) {
    if (b[i] * 1LL * (n - i) <= k) {
      k -= b[i] * 1LL * (n - i);
      cnt += b[i];
      continue;
    }
    cnt += k / (n - i);
    k %= (n - i);
    ans.reserve(n - i);
    for (int j = 0; j < n; j++) {
      if (a[j] > cnt) ans.push_back(j);
      a[j] -= cnt;
    }
    break;
  }
  if (k > 0 && ans.size() == 0) {
    printf("-1\n");
    return 0;
  }
  if (k == 0 && ans.size() == 0) {
    printf("\n");
    return 0;
  }
  for (int i = 0; i < k; i++) a[ans[i]]--;
  rotate(ans.begin(), ans.begin() + k, ans.end());
  vector<int> ans2;
  for (int i = 0; i < ans.size(); i++)
    if (a[ans[i]] != 0) ans2.push_back(ans[i]);
  for (int i = 0; i < ans2.size(); i++) printf("%d ", ans2[i] + 1);
  printf("\n");
  return 0;
}
