#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
inline long long in() {
  long long x = 0, flag = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  return x * flag;
}
int n, m;
long long a[MAXN], d[MAXN];
long long presum;
int main() {
  n = in();
  m = in();
  for (int i = 1; i <= n; i++) {
    a[i] = in();
  }
  for (int i = 1, j = 1; i <= n; i++) {
    d[i] = presum - (j - 1) * (n - i) * a[i] * 1LL;
    presum += a[i] * (j - 1) * 1LL;
    if (d[i] < m) {
      printf("%d\n", i);
      presum -= a[i] * (j - 1) * 1LL;
    } else
      j++;
  }
  return 0;
}
