#include <bits/stdc++.h>
using namespace std;
long long a[200010], b, c, d, e, f, g, h, i, j, k, m, n;
long long ou[200010];
long long p, q;
void deal() {
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  e = n;
  f = 2;
  h = n;
  p = 0;
  q = 0;
  m = 0;
  for (i = 2; i <= h; i++) {
    q = p - (f - 1) * (e - f) * a[i];
    if (q < k) {
      e--;
      m++;
      ou[m] = i;
    } else {
      p = p + a[i] * (f - 1);
      f++;
    }
  }
  for (i = 1; i <= m; i++) printf("%d\n", ou[i]);
}
int main() {
  int tc = 0;
  while (cin >> n >> k) {
    if (tc++) printf("\n");
    deal();
  }
  return 0;
}
