#include <bits/stdc++.h>
using namespace std;
struct Node {
  int id;
  long long a;
} node[200005], *p, *q;
int n, k;
int main(int argc, char **argv) {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    cin >> node[i].a;
    node[i].id = i;
  }
  int i, nn = n;
  long long d = 0;
  for (i = 1, p = &node[1], q = &node[0]; p <= node + nn; ++p, ++i) {
    long long dd = d;
    if (i == 1)
      d = 0;
    else
      d = d + q->a * (i - 2);
    if (d - (n - i) * (p->a) * (i - 1) < k) {
      cout << p->id << endl;
      i--;
      n--;
      d = dd;
    } else
      q = p;
  }
  return 0;
}
