#include <bits/stdc++.h>
using namespace std;
long long int a[100001];
long long int b[100001];
int main() {
  long long int n;
  cin >> n;
  long long int k;
  cin >> k;
  long long int sum = 0;
  for (long long int i = 1; i <= n; ++i) {
    cin >> a[i];
    sum += a[i];
    b[i] = a[i];
  }
  if (sum < k) {
    cout << -1 << endl;
    return 0;
  }
  if (sum == k) {
    cout << endl;
    return 0;
  }
  sort(a + 1, a + n + 1);
  long long int x = 0;
  long long int cnt = 0;
  for (long long int i = 1; i <= n; ++i) {
    if (a[i] == a[i - 1]) {
      continue;
    }
    if (k / (n - i + 1) >= a[i] - a[i - 1]) {
      k -= ((a[i] - a[i - 1]) * (n - i + 1));
      x = a[i];
    } else {
      cnt = (k / (n - i + 1));
      k -= ((k / (n - i + 1)) * (n - i + 1));
      break;
    }
  }
  vector<int> g;
  int len = 0;
  for (int i = 1; i <= n; ++i) {
    if (b[i] > x) {
      g.push_back(i);
      ++len;
    }
  }
  for (int i = k; i < len; ++i) cout << g[i] << " ";
  for (int i = 0; i < k; ++i) {
    if (b[g[i]] > x + cnt + 1) {
      cout << g[i] << " ";
    }
  }
  return 0;
}
