#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:200000000")
using namespace std;
const int INF = (int)1e9;
const long long INF64 = (long long)1e18;
const long double eps = 1e-9;
const long double pi = 3.14159265358979323846;
int n, k;
vector<int> d;
inline bool read() {
  if (scanf("%d %d", &n, &k) != 2) return false;
  d.resize(n);
  for (int i = 0; i < int(n); ++i) {
    scanf("%d", &d[i]);
  }
  return true;
}
inline void solve() {
  long long cur = 0;
  long long curidx = 1;
  for (int i = 0; i < int(n); ++i) {
    if (i) {
      long long curdelta = 0;
      curdelta += cur;
      long long curd = d[i];
      curd *= curidx * (long long)(n - i - 1);
      curdelta -= curd;
      if (curdelta < k) {
        printf("%d\n", i + 1);
      } else {
        curd = (long long)d[i];
        curd *= (long long)curidx;
        curidx++;
        cur += curd;
      }
    }
  }
}
int main() {
  while (read()) solve();
}
