#include <bits/stdc++.h>
using namespace std;
static const int INF = 500000000;
template <class T>
void debug(T a, T b) {
  for (; a != b; ++a) cerr << *a << ' ';
  cerr << endl;
}
int n;
long long int k;
long long int ar[100005];
pair<long long int, long long int> ar2[100005];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    cin >> ar[i];
    ar2[i] = make_pair(ar[i], i);
  }
  sort(ar2, ar2 + n);
  long long int cost = 0, prev = 0;
  for (int i = 0; i < n; ++i) {
    cost += (ar2[i].first - prev) * (n - i);
    if (cost >= k) {
      cost -= (ar2[i].first - prev) * (long long int)(n - i);
      long long int rest = k - cost;
      long long int decr = rest / (n - i);
      for (int j = 0; j < n; ++j) ar[j] -= decr + prev;
      long long int rest2 = rest - decr * (n - i);
      int pos = 0;
      for (int j = 0; rest2 > 0; ++j)
        if (ar[j] > 0) {
          --ar[j];
          --rest2;
          pos = j + 1;
        }
      vector<int> res;
      for (int j = 0; j < n; ++j) {
        int p = (pos + j) % n;
        if (ar[p] > 0) res.push_back(p);
      }
      for (int j = 0; j < res.size(); ++j) printf("%d\n", res[j] + 1);
      return 0;
    }
    prev = ar2[i].first;
  }
  puts("-1");
  return 0;
}
