#include <bits/stdc++.h>
using namespace std;
long long func(vector<pair<long long, long long>> &spvec,
               vector<long long> &vec, long long target) {
  long long n = spvec.size(), ans = 0, rem = n, gstart = 0, sub = 0;
  for (int i = 0; i < n; i++) {
    if (i == target) {
      ans += (rem * (spvec[target].first - sub - 1));
      for (int j = 0; j <= spvec[target].second; j++) {
        if ((vec[j] > spvec[target].first) ||
            (vec[j] == spvec[target].first && j <= spvec[target].second)) {
          ans++;
        }
      }
      break;
    } else if (spvec[i].first != spvec[i + 1].first) {
      ans += (rem * (spvec[i].first - sub));
      sub = spvec[i].first;
      rem -= (i - gstart + 1);
      gstart = i + 1;
    }
  }
  return ans;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  vector<long long> vec(n);
  vector<pair<long long, long long>> spvec(n);
  for (long long i = 0; i < n; i++) {
    cin >> vec[i];
    spvec[i].first = vec[i], spvec[i].second = i;
  }
  sort(spvec.begin(), spvec.end());
  long long low = 0, high = n - 1;
  if (func(spvec, vec, low) > k) {
    for (long long i = k % n; i < k % n + n; i++) {
      cout << i % n + 1 << " ";
    }
    cout << endl;
  } else if (func(spvec, vec, high) < k) {
    cout << -1 << endl;
  } else if (func(spvec, vec, high) == k) {
    cout << endl;
  } else {
    while (high - low > 1) {
      long long mid = (low + high) >> 1;
      if (func(spvec, vec, mid) <= k) {
        low = mid;
      } else {
        high = mid;
      }
    }
    vector<pair<long long, long long>> filt;
    for (long long i = spvec[low].second + 1; i < spvec[low].second + 1 + n;
         i++) {
      if ((vec[i % n] > spvec[low].first) ||
          (vec[i % n] == spvec[low].first && i % n > spvec[low].second)) {
        filt.push_back({vec[i % n], i % n});
      }
    }
    long long rem_visits = k - func(spvec, vec, low), rem_animals = n - low - 1,
              inc = rem_visits % rem_animals;
    for (long long i = inc; i < inc + rem_animals; i++) {
      cout << filt[i % rem_animals].second + 1 << " ";
    }
    cout << endl;
  }
}
