#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10, inf = 1e9 + 10, MOD = 1e9 + 7, Sq = 708;
const long long INF = 1e18 + 10;
long long a[maxn], sum1 = 0;
vector<int> ans;
int main() {
  ios_base::sync_with_stdio(false);
  int n, k, cnt = 0;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (sum1 - 1ll * ((n - cnt) - (i - cnt)) * a[i] * (i - 1 - cnt) < k) {
      cnt++;
      ans.push_back(i);
    } else
      sum1 += (a[i] * (i - cnt - 1));
  }
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << endl;
  return 0;
}
