#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const long long INF = std::numeric_limits<long long>::max();
const int MX = 100101;
const long double PI =
    3.14159265358979323846264338327950288419716939937510582097494L;
template <typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) {
  return pair<T, T>(a.first + b.first, a.second + b.second);
}
template <typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) {
  return pair<T, T>(a.first - b.first, a.second - b.second);
}
template <typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) {
  return (a.first * b.first + a.second * b.second);
}
template <typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) {
  return (a.first * b.second - a.second * b.first);
}
template <typename T>
void print(vector<T> vec, string name = "") {
  cout << name;
  for (auto u : vec) cout << u << ' ';
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long N, K;
  cin >> N >> K;
  vector<pair<long long, long long> > sk(N);
  long long sum = 0;
  for (int i = 0; i < N; ++i) {
    cin >> sk[i].first, sk[i].second = i;
    sum += sk[i].first;
  }
  if (sum < K) return !printf("-1\n");
  sort(sk.begin(), sk.end());
  long long curr = 0;
  long long kiekpilnu = 0;
  for (int i = 0; i < N; ++i) {
    long long kiekis = N - i;
    long long kitas = (K - curr) / kiekis;
    long long imsiu = min(sk[i].first - kiekpilnu, kitas);
    curr += kiekis * imsiu;
    kiekpilnu += imsiu;
    if (imsiu != (sk[i].first - (kiekpilnu - imsiu))) break;
  }
  sort(sk.begin(), sk.end(),
       [](pair<long long, long long> a, pair<long long, long long> b) {
         return a.second < b.second;
       });
  deque<int> ats;
  for (int i = 0; i < N; ++i) {
    if (sk[i].first > kiekpilnu) {
      sk[i].first -= kiekpilnu;
      ats.push_back(sk[i].second);
    }
  }
  for (long long i = 0; i < K - curr; ++i) {
    int c = ats.front();
    ats.pop_front();
    sk[c].first--;
    if (sk[c].first > 0) ats.push_back(c);
  }
  while (ats.size()) {
    printf("%d ", ats.front() + 1);
    ats.pop_front();
  }
  printf("\n");
}
