#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  int k;
  scanf("%d", &k);
  int i;
  vector<int> ans_arr;
  long long aux_sum = 0;
  for (i = 1; i < n + 1; i++) {
    int cur_rating;
    scanf("%d", &cur_rating);
    if (i == 1) {
      if (k > 0) ans_arr.push_back(1);
      continue;
    }
    int removed = int((ans_arr).size());
    int i_eff = i - removed;
    long long d_cur = aux_sum - (long long)(i_eff - 1) * (n - i) * cur_rating;
    if (d_cur < (long long)k) {
      ans_arr.push_back(i);
    } else
      aux_sum += (long long)(i_eff - 1) * cur_rating;
  }
  for (i = 0; i < int((ans_arr).size()); i++) printf("%d\n", ans_arr[i]);
}
