#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n + 1, 0);
  vector<long long> sum(n + 3, 0);
  for (int i = 1; i <= n; i++) {
    cin >> v[i];
  }
  bool rem = true;
  int last = 2;
  int tot = 0;
  long long sub = 0;
  while (rem) {
    rem = false;
    for (int i = last; i <= n; i++) {
      sum[i + 1] = sum[i];
      sum[i + 1] += v[i] * (i - 1 - tot);
      long long val = v[i];
      val *= n - i;
      val *= (i - 1 - tot);
      val *= -1;
      val += sum[i] - sub;
      if (val < k) {
        last = i + 1;
        sub += sum[i + 1] - sum[i];
        rem = true;
        cout << i << '\n';
        tot++;
        break;
      }
    }
  }
  return 0;
}
