#include <bits/stdc++.h>
using namespace std;
long long N, M, Ans, Sum;
long long Num[100010], C[100010];
void Solve() {
  sort(C + 1, C + N + 1);
  Sum = Ans = 0;
  for (int i = 1; i <= N; i++) {
    long long W = C[i] - Ans;
    if (Sum + W * (N - i + 1) <= M) {
      Sum += W * (N - i + 1);
      Ans += W;
    } else {
      Ans += (M - Sum) / (N - i + 1);
      Sum = (M - Sum) % (N - i + 1);
      return;
    }
  }
}
void Output() {
  int k = 1;
  for (int i = 1; i <= N; i++) Num[i] -= Ans;
  for (int i = 1, j = 0; i <= N; i++) {
    if (j == Sum) break;
    if (Num[i] > 0) {
      j++;
      Num[i]--;
      k = i;
    }
  }
  if (Sum) k++;
  for (int i = k; i <= N; i++)
    if (Num[i] > 0) cout << i << " ";
  for (int i = 1; i <= k - 1; i++)
    if (Num[i] > 0) cout << i << " ";
  cout << endl;
}
int main() {
  while (cin >> N >> M) {
    Ans = 0;
    for (int i = 1; i <= N; i++) {
      cin >> Num[i];
      C[i] = Num[i];
      Ans += C[i];
    }
    if (Ans < M)
      cout << -1 << endl;
    else {
      Solve();
      Output();
    }
  }
}
