#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e6 + 7;
const int MOD = (int)1e9 + 7;
long long calc(int n, int i, long long x) {
  int r = n - 1, l = n - i;
  return (n - i) * 1ll * x * 1ll * (i - 1);
}
int main() {
  int n;
  long long k;
  cin >> n >> k;
  vector<long long> a(N);
  for (int i = 1; i <= n; i++) cin >> a[i];
  long long cur = 0;
  int p = n, last = 1;
  vector<int> ans;
  for (int i = 2; i <= n; i++) {
    long long value = cur;
    value -= calc(p, last + 1, a[i]);
    if (value < k) {
      ans.push_back(i);
      p--;
    } else {
      cur += a[i] * 1ll * last;
      last++;
    }
  }
  for (auto x : ans) cout << x << '\n';
  return 0;
}
