#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000ll;
const int MAXN = 222222;
long long n, k, a[MAXN], d[MAXN];
int main() {
  cin >> n >> k;
  for (int i = (1); i <= (n); i++) cin >> a[i];
  long long sum = 0;
  d[1] = 0;
  for (int i = (2); i <= (n); i++) {
    int dd = -(n - i) * a[i] * (i - 1);
    d[i] = dd + sum;
    sum += a[i] * (i - 1);
  }
  sum = 0;
  long long place = 2, nn = n;
  for (int i = (2); i <= (n - 1); i++) {
    long long delta = sum - (nn - place) * a[i] * (place - 1);
    if (delta < k) {
      nn--;
      cout << i << "\n";
    } else {
      sum += (place - 1) * a[i];
      place++;
    }
  }
  int delta = sum - (nn - place) * a[n] * (place - 1);
  if (delta < k) cout << n;
  return 0;
}
