#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN(200005);
long long a[MAXN], d[MAXN];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int m = 1, p = n;
  cin >> a[1];
  d[1] = 0;
  for (int i = 2; i <= n; i++) {
    int x;
    scanf("%d", &x);
    long long tmp = d[m] + a[m] * (m - 1);
    if (tmp - (long long)(m) * (p - (m + 1)) * x >= k) {
      m++;
      a[m] = x;
      d[m] = tmp;
    } else {
      printf("%d\n", i);
      p--;
    }
  }
}
