#include <bits/stdc++.h>
using namespace std;
const int Max = 200010;
int n, k;
long long a[Max];
long long d;
long long pos1, pos2, pos3, pre;
int main() {
  while (scanf("%d%d", &n, &k) != -1) {
    pos1 = 0;
    pre = 1;
    pos2 = 1;
    pos3 = n;
    for (int i = 1; i <= n; i++) {
      scanf("%I64d", &a[i]);
    }
    for (int i = 2; i <= n; i++) {
      d = pos1 + a[pre] * (pos2 - 1) - pos2 * (pos3 - pos2 - 1) * a[i];
      if (d < k) {
        printf("%d\n", i);
        pos3 = pos3 - 1;
      } else {
        pos1 = pos1 + a[pre] * (pos2 - 1);
        pos2++;
        pre = i;
      }
    }
  }
  return 0;
}
