#include <bits/stdc++.h>
using namespace std;
mt19937 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
const long double PI = 3.141592653589793;
const long long INF = 9223372036854775807ll;
const long long mod = 1e9 + 7;
void solve() {
  long long n, k;
  cin >> n >> k;
  vector<pair<long long, long long>> a(n);
  vector<long long> goin(n);
  map<long long, long long> mp;
  for (int i = 0; i < n; ++i) {
    long long cur;
    cin >> cur;
    mp[cur]++;
    goin[i] = cur;
  }
  long long tot = n;
  long long done = 0;
  for (auto x : mp) {
    long long cando = k / tot;
    long long next = x.first - done;
    if (cando < next) {
      k -= cando * tot;
      done += cando;
      for (int i = 0; i < n; ++i) {
        if (k == 0) {
          for (int start = i; start < i + n; ++start) {
            if (start == n) done++;
            if (goin[start % n] > done) {
              cout << (((start) % (n)) + 1) << " ";
            }
          }
          break;
        }
        if (goin[i] > done) {
          k--;
        }
      }
      break;
    } else {
      k -= next * tot;
      done = x.first;
      tot -= x.second;
    }
  }
  if (k) cout << -1 << '\n';
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  solve();
  return 0;
}
