#include <bits/stdc++.h>
const double eps = (1e-10);
using namespace std;
int dcmp(double a, double b) {
  return fabs(a - b) <= eps ? 0 : (a > b) ? 1 : -1;
}
long long getBit(long long num, int idx) { return ((num >> idx) & 1ll) == 1ll; }
long long setBit1(long long num, int idx) { return num | (1ll << idx); }
long long setBit0(long long num, int idx) { return num & ~(1ll << idx); }
long long flipBit(long long num, int idx) { return num ^ (1ll << idx); }
int countNumBit1(long long mask) {
  int ret = 0;
  while (mask) {
    mask &= (mask - 1ll);
    ++ret;
  }
  return ret;
}
vector<pair<int, int>> v;
vector<int> v2, v1;
int main() {
  long long n, k;
  cin >> n >> k;
  long long s = 0, no;
  for (int i = 1; i <= n; i++) {
    cin >> no;
    v.push_back(make_pair(no, i));
    v2.push_back(no);
    s += no;
  }
  if (s < k) {
    cout << "-1\n";
    return 0;
  }
  sort(((v2).begin()), ((v2).end()));
  long long c = 0, Ci;
  int emptyy = 0;
  while (1) {
    if (v2.back() <= c) {
      emptyy = 1;
      break;
    }
    int id = upper_bound(((v2).begin()), ((v2).end()), c) - v2.begin();
    long long turns = v2[id] - c;
    int N = n - id;
    long long m = min(turns, k / N);
    if (k == 0)
      break;
    else if (k < N) {
      Ci = c;
      break;
    } else if (k >= N) {
      c += m;
      k -= m * N;
    }
  }
  if (emptyy) {
    cout << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (k == 0 && v[i].first > c)
      cout << v[i].second << " ";
    else if (k > 0 && v[i].first > c) {
      v[i].first--;
      if (v[i].first - c > 0) v1.push_back(v[i].second);
      k--;
    }
  }
  for (int i = 0; i < ((int)(v1).size()); i++) cout << v1[i] << " ";
}
