#include <bits/stdc++.h>
using namespace std;
long long N, K;
struct contestant {
  int orgrate;
  int orgplace;
} a[200001];
int main() {
  cin >> N >> K;
  for (int i = 1; i <= N; ++i) {
    cin >> a[i].orgrate;
    a[i].orgplace = i;
  }
  long long sum = 0;
  int shift = 0;
  for (int i = 2; i <= N; ++i) {
    if (sum - (i - shift - 1) * (N - i) * a[i].orgrate < K) {
      cout << a[i].orgplace << endl;
      ++shift;
    } else {
      sum += a[i].orgrate * (i - 1 - shift);
    }
    if (i == N) return 0;
  }
}
