#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:36777216")
using namespace std;
struct point {
  long long value;
  int order;
};
bool comp(point a, point b) { return a.value < b.value; }
int main() {
  map<long long, int> m;
  long long k;
  long long sum = 0;
  int n;
  point a[123467];
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i].value;
    a[i].order = i;
    m[a[i].value]++;
    sum += a[i].value;
  }
  if (sum < k) {
    cout << -1;
    return 0;
  }
  long long left = n;
  long long minn = 0;
  if (sum > k) {
    for (map<long long, int>::iterator it = m.begin(); it != m.end(); it++) {
      if ((it->first - minn) * left <= k) {
        k -= (it->first - minn) * left;
        left -= it->second;
        minn = it->first;
      } else {
        if ((it->first - minn) * left > k) {
          minn += k / left;
          k %= left;
          break;
        }
      }
    }
    int firstIndex = 0;
    for (int i = 0; i < n; i++) {
      if (a[i].value > minn) {
        if (k == 0) {
          firstIndex = i;
          break;
        } else
          k--;
      }
    }
    for (int i = firstIndex; i < n; i++) {
      if (a[i].value > minn) cout << i + 1 << " ";
    }
    for (int i = 0; i < firstIndex; i++) {
      if (a[i].value > minn + 1) cout << i + 1 << " ";
    }
  }
  return 0;
}
