#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n, k;
int a[maxn];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  vector<long long> d(n + 1);
  long long s = 0;
  vector<int> ans;
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (i == 1)
      d[i] = 0;
    else {
      long long val = (long long)(n - i) * a[i] * cnt;
      if (val / cnt != (long long)(n - i) * a[i])
        d[i] = -(long long)(1e18);
      else
        d[i] = s - val;
    }
    if (d[i] < (long long)k)
      ans.push_back(i);
    else
      s += (long long)a[i] * cnt, ++cnt;
  }
  for (int i = 0; i < (int)ans.size(); i++) printf("%d\n", ans[i]);
  return 0;
}
