#include <bits/stdc++.h>
using namespace std;
int num[100005];
long long calc(int mid, int n) {
  long long ret = 0;
  for (int i = 0; i < n; i++) {
    ret += min(num[i], mid);
  }
  return ret;
}
int main() {
  long long n, k;
  while (cin >> n >> k) {
    long long sum = 0;
    for (int i = 0; i < n; i++) {
      cin >> num[i];
      sum += num[i];
    }
    if (k > sum) {
      puts("-1");
      continue;
    }
    int left = 0;
    int right = 1000000001;
    while (left <= right) {
      int mid = (left + right) >> 1;
      long long t = calc(mid, n);
      if (k > t) {
        left = mid + 1;
      } else {
        right = mid - 1;
      }
    }
    k -= calc(--left, n);
    vector<int> list;
    int i;
    for (i = 0; i < n && k; i++) {
      if (num[i] > left) {
        k--;
      }
    }
    for (int j = i; j < n; j++) {
      if (num[j] > left) {
        list.push_back(j + 1);
      }
    }
    for (int j = 0; j < i; j++) {
      if (num[j] > left + 1) {
        list.push_back(j + 1);
      }
    }
    for (int j = 0; j < (int)list.size(); j++) {
      if (j != 0) {
        printf(" ");
      }
      printf("%d", list[j]);
    }
    puts("");
  }
  return 0;
}
