#include <bits/stdc++.h>
using namespace std;
string alpha = "abcdefghijklmnopqrstuvwxyz";
int MOD = 1000000007;
const int N = 100100;
int GCD(long long num, long long ones) {
  return !ones ? num : GCD(ones, num % ones);
}
long long lcm(long long a, long long b) { return (a / GCD(a, b)) * b; }
int n;
long long k, arr[N];
int main() {
  priority_queue<pair<int, int>, vector<pair<int, int> >,
                 greater<pair<int, int> > >
      pq;
  scanf("%d", &n);
  scanf("%lld", &k);
  long long x, c = 0;
  for (int i = 0; i < n; ++i) scanf("%lld", &x), pq.push({x, i}), arr[i] = x;
  int cur = n;
  deque<int> dq;
  while (!pq.empty() && k >= cur) {
    long long tmp = pq.top().first;
    tmp -= c;
    long long am = min(k / cur, tmp);
    c += am;
    k -= am * cur;
    while (!pq.empty() && pq.top().first == c) pq.pop(), cur--;
  }
  if (k > cur) return puts("-1");
  while (!pq.empty()) dq.push_back(pq.top().second), pq.pop();
  sort(dq.begin(), dq.end());
  while (k--) {
    int p = dq.front();
    dq.pop_front();
    if (arr[p] - c - 1 > 0) dq.push_back(p);
  }
  for (int i = 0; i < (dq.size()); ++i) printf("%d ", dq[i] + 1);
  return 0;
}
