#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000, N = 200000;
long long n, k, j, a[N], b[N], t, sum, s;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
    sum += a[i];
  }
  if (sum <= k) {
    if (sum < k) cout << -1;
    return 0;
  }
  sort(b, b + n);
  sum = 0;
  long long ncur = n, pcur;
  for (j = 0; j < n && sum <= k; j++) {
    s = sum;
    pcur = ncur;
    sum += (b[j] - (j > 0 ? b[j - 1] : 0)) * ncur;
    ncur--;
  }
  vector<long long> v;
  for (int i = 0; i < n; i++)
    if (a[i] > b[j - 2]) v.push_back(i + 1);
  t = (k - s) % pcur;
  s = (k - s) / pcur;
  for (int i = t; i < v.size(); i++) cout << v[i] << " ";
  for (int i = 0; i < t; i++)
    if (a[v[i] - 1] > b[j - 2] + s + 1) cout << v[i] << " ";
  return 0;
}
