#include <bits/stdc++.h>
using namespace std;
int N;
long long K;
int num[100010];
bool check(int mid) {
  long long sum = 0;
  for (int i = 0; i < N; i++) {
    sum += min(num[i], mid);
  }
  return sum >= K;
}
int main() {
  while (cin >> N >> K) {
    long long sum = 0;
    for (int i = 0; i < N; i++) {
      scanf("%d", num + i);
      sum += num[i];
    }
    if (sum <= K) {
      if (sum < K) puts("-1");
      continue;
    }
    int low = -1, high = 1000000000;
    while (low + 1 < high) {
      int mid = (low + high) / 2;
      if (check(mid))
        high = mid;
      else
        low = mid;
    }
    for (int i = 0; i < N; i++) {
      K -= min(num[i], high - 1);
      num[i] -= min(num[i], high - 1);
    }
    int i;
    for (i = 0; i < N; i++)
      if (num[i]) {
        num[i] -= 1;
        K--;
        if (K == 0) break;
      }
    vector<int> ans;
    for (int j = i + 1; j < N; j++)
      if (num[j]) ans.push_back(j + 1);
    for (int j = 0; j <= i; j++)
      if (num[j]) ans.push_back(j + 1);
    for (i = 0; i < ans.size() - 1; i++) {
      printf("%d ", ans[i]);
    }
    cout << ans[i] << endl;
  }
  return 0;
}
