#include <bits/stdc++.h>
using namespace std;
long long n, k, a[200005], d[200005];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> a[i];
  long long s = 0, p = 0, curr_n = n;
  for (int i = 0; i < n; i++) {
    d[i] = s - p * (curr_n - 1 - p) * a[i];
    if (d[i] < k) {
      cout << (i + 1) << endl;
      curr_n--;
    } else {
      s += p * a[i];
      p++;
    }
  }
}
