#include <bits/stdc++.h>
using namespace std;
long long n;
long long m;
long long a[(long long)1e5 + 5];
set<pair<long long, long long> > Hash;
vector<long long> Q;
vector<long long> Del;
long long Get_Rest(long long rest, long long delta) {
  long long l = 0, r = (long long)1e9, mid;
  while (l < r) {
    mid = (l + r + 1) / 2;
    if (rest - Hash.size() * mid >= 0)
      l = mid;
    else
      r = mid - 1;
  }
  return l;
}
void Output(long long rest, long long delta) {
  long long i, cnt, st;
  Del.clear();
  long long tmp = Get_Rest(rest, delta);
  rest -= tmp * Hash.size();
  delta += tmp;
  Q.clear();
  st = 1;
  for (cnt = 0, i = 1; i <= n; i++) {
    if (a[i] > delta) {
      cnt++;
    }
    if (cnt <= rest) {
      a[i]--;
      st = i % n + 1;
    }
  }
  i = st;
  do {
    if (a[i] > delta) Q.push_back(i);
    i = i % n + 1;
  } while (i != st);
  if (Q.size() == 0) {
    puts("");
    return;
  }
  printf("%I64d", Q[0]);
  for (i = 1; i < Q.size(); i++) printf(" %I64d", Q[i]);
  printf("\n");
}
int main() {
  cin >> n >> m;
  Hash.clear();
  for (long long i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    Hash.insert(make_pair(a[i], i));
  }
  if (m == 0) {
    printf("%I64d", (long long)1);
    for (long long i = 2; i <= n; i++) printf(" %I64d", i);
    printf("\n");
    return 0;
  }
  long long cnt = 0;
  long long delta = 0;
  bool check = false;
  while (cnt < m && Hash.size() > 0) {
    set<pair<long long, long long> >::iterator it = Hash.begin();
    long long tmp = cnt;
    cnt += (long long)Hash.size() * (it->first - delta);
    if (cnt >= m) {
      Output(m - tmp, delta);
      check = true;
      break;
    }
    delta = it->first;
    while (Hash.size() > 0 && Hash.begin()->first == delta)
      Hash.erase(Hash.begin());
  }
  if (!check) printf("-1\n");
}
