#include <bits/stdc++.h>
using namespace std;
int main() {
  long long psm = 0, chng, prev = 0, mxn;
  int n, i, j, val, k;
  cin >> n >> k;
  mxn = n;
  vector<int> ans;
  for ((i) = 0; (i) < (n); (i)++) {
    scanf("%d", &val);
    chng = psm - ((prev)*val) * (mxn - prev - 1);
    if (chng < k) {
      ans.push_back(i + 1);
      mxn--;
    } else {
      psm += prev * val;
      prev++;
    }
  }
  for ((i) = 0; (i) < (ans.size()); (i)++) printf("%d\n", ans[i]);
  return 0;
}
