#include <bits/stdc++.h>
using namespace std;
long long n, k, l, r, sum, mid;
long long a[100000];
int main() {
  while (cin >> n >> k) {
    sum = 0;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      sum += a[i];
    }
    l = 0;
    r = k;
    if (sum < k) {
      cout << -1 << endl;
      continue;
    }
    if (sum == k) continue;
    while (l < r) {
      mid = (r + l) / 2;
      sum = 0;
      int flag = 0;
      for (int i = 0; i < n; i++) {
        if (a[i] >= mid)
          sum += mid;
        else
          sum += a[i];
        if (sum > k) {
          r = mid;
          flag = 1;
          break;
        }
      }
      if (flag == 0) l = mid + 1;
    }
    l = l - 1;
    sum = 0;
    for (int i = 0; i < n; i++) sum += (a[i] > l) ? l : a[i];
    k = k - sum;
    for (int i = 0; i < n; i++) {
      if (k == 0) {
        k = i;
        break;
      }
      if (a[i] > l) k--;
    }
    for (int i = k; i < n; i++)
      if (a[i] > l) cout << i + 1 << " ";
    for (int i = 0; i < k; i++)
      if (a[i] > l + 1) cout << i + 1 << " ";
    cout << endl;
  }
  return 0;
}
