#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, k, pre = 0;
  cin >> n >> k;
  vector<long long> arr(n + 1);
  for (int i = 1; i <= n; i++) cin >> arr[i];
  long long e = 2, sz = n;
  for (int i = 2; i <= n; i++) {
    long long cur = pre + (e - 1) * 1ll * (-(sz - e) * 1ll * arr[i]);
    if (cur < k) {
      cout << i << "\n";
      sz--;
    } else {
      pre += arr[i] * (e - 1);
      e++;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
