#include <bits/stdc++.h>
using namespace std;
long long mas[200100], k, s = 0, d;
long long n, p = 1, del = 0, a, b, c;
unsigned long long inf =
    (unsigned long long)1000000000 * 1000000000 * (long long)10;
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) scanf("%I64d", &mas[i]);
  for (int i = 1; i <= n; i++, p++) {
    a = (p - 1);
    b = (n - del - p);
    c = mas[i];
    if (a * b > (s - k) / c) {
      printf("%d\n", i);
      p--;
      del++;
    } else {
      if (s < inf) s += (p - 1) * mas[i];
    }
  }
  return 0;
}
