#include <bits/stdc++.h>
using namespace std;
queue<int> ans;
int main() {
  long long int n = 0;
  long long int k = 0;
  cin >> n >> k;
  long long int arr[n];
  long long int tmp[n];
  long long int sum = 0;
  for (long long int i = 1; i <= n; i++) {
    cin >> arr[i];
    tmp[i] = arr[i];
    sum = sum + arr[i];
  }
  if (sum < k) {
    cout << "-1";
  } else if (sum == k) {
    return 0;
  } else if (k == 0) {
    for (long long int i = 1; i <= n; i++) {
      cout << i << " ";
    }
  } else {
    sort(tmp + 1, tmp + n + 1);
    long long int i = 1;
    long long int rem = 0;
    while (1) {
      long long int min = tmp[i];
      long long int m = n - i + 1;
      while (min == tmp[i]) {
        i++;
      }
      min = min - rem;
      if (k / min > m) {
        k = k - m * min;
        rem = rem + min;
      } else {
        rem = rem + k / m;
        k = k - k / m * m;
        for (long long int x = 1; x <= n; x++) {
          if (arr[x] > rem) {
            if (k == 0) {
              cout << x << " ";
            } else {
              k = k - 1;
              if (arr[x] > rem + 1) {
                ans.push(x);
              }
            }
          }
        }
        while (!ans.empty()) {
          cout << ans.front() << " ";
          ans.pop();
        }
        return 0;
      }
    }
  }
}
