#include <bits/stdc++.h>
using namespace std;
const int oo = 2000000009;
const double eps = 1e-9;
int n, k;
int a[200005];
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= (n); ++i) scanf("%d", a + i);
  long long second, first = 0;
  int rem = 0;
  int pos = 1;
  for (int i = 1; i <= (n); ++i) {
    second =
        ((long long)(pos - 1) * (n - rem) - (long long)pos * (pos - 1)) * a[i];
    if (first - second >= k) {
      first += a[i] * (long long)(pos - 1);
      ++pos;
    } else {
      ++rem;
      printf("%d\n", i);
    }
  }
  return 0;
}
