#include <bits/stdc++.h>
using namespace std;
long long k, a[100005];
int n;
bool check(long long x) {
  long long sum = 0;
  for (int i = 1; i <= n; i++)
    if (a[i] < x)
      sum += a[i];
    else
      sum += x - 1;
  return sum <= k;
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  long long ans, sum;
  sum = 0;
  for (int i = 1; i <= n; i++) sum += a[i];
  if (sum < k) {
    cout << "-1" << endl;
    return 0;
  }
  if (sum == k) {
    return 0;
  }
  long long l, r, mid;
  l = r = a[1];
  for (int i = 2; i <= n; i++) l = min(l, a[i]), r = max(r, a[i]);
  l = 0;
  while (l <= r) {
    mid = (l + r) / 2;
    if (check(mid))
      ans = mid, l = mid + 1;
    else
      r = mid - 1;
  }
  int p;
  sum = 0;
  for (int i = 1; i <= n; i++)
    if (a[i] < ans)
      sum += a[i];
    else
      sum += ans - 1;
  for (int i = 1; i <= n; i++)
    if (a[i] >= ans) {
      if (sum == k) {
        p = i;
        break;
      }
      sum++;
    }
  for (int i = p; i <= n; i++)
    if (a[i] >= ans) cout << i << " ";
  for (int i = 1; i < p; i++)
    if (a[i] > ans) cout << i << " ";
}
