#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:128777216")
const long long LINF = 1000000000000000000LL;
const int INF = 1000000000;
const long double eps = 1e-9;
const long double PI = 3.1415926535897932384626433832795l;
using namespace std;
void prepare(string s) {
  if (s.length() != 0) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
const int NMAX = 200100;
long long a[NMAX], d[NMAX];
int main() {
  clock_t time = clock();
  prepare("");
  int n, k, v;
  cin >> n >> k;
  for (int i = (int)1; i <= (int)n; i++) {
    cin >> a[i];
  }
  int l = 1, cnt = 0;
  long long t;
  while (l != n + 1) {
    t = d[l - 1] - (n - l) * a[l] * (l - cnt - 1);
    if (t < k) {
      cout << l << endl;
      cnt++;
      d[l] = d[l - 1];
    } else {
      d[l] = d[l - 1] + a[l] * (l - cnt - 1);
    }
    l++;
  }
  time = clock() - time;
  return 0;
}
