#include <bits/stdc++.h>
using namespace std;
int n, m;
long long k, a[200003], d[200003], f[200003];
vector<int> res;
int main() {
  res.clear();
  int i, x, j;
  scanf("%d%d", &n, &x);
  k = x;
  for (i = 1; i <= n; i++) {
    scanf("%d", &x);
    a[i] = x;
  }
  d[1] = 0;
  a[0] = 0;
  d[0] = 0;
  f[0] = 0;
  f[1] = 0;
  j = 1;
  m = n;
  m = n;
  for (i = 2; i <= n; i++) {
    j++;
    a[j] = a[i];
    f[j] = f[j - 1] + (a[j - 1] * (j - 2));
    d[j] = f[j] - (a[j] * (j - 1) * (m - j));
    if (d[j] < k) {
      res.push_back(i);
      j--;
      m--;
    }
  }
  n = res.size();
  for (i = 0; i < n; i++) printf("\n%d", res[i]);
  return 0;
}
