#include <bits/stdc++.h>
using namespace std;
long long a[200100];
int vis[200100];
int p[200100];
int n, k;
int main() {
  while (scanf("%d%d", &n, &k) != EOF) {
    a[0] = 0;
    for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
    memset(vis, 0, sizeof(vis));
    int cnt = n;
    long long sum = 0;
    int m = 0;
    p[0] = 0;
    for (int i = 1; i <= n; i++) {
      long long t = a[p[m]] * (m - 1);
      long long s = a[i] * (cnt - (m + 1)) * m;
      if (sum + t - s >= k) {
        sum += t;
        m++;
        p[m] = i;
        continue;
      } else {
        cnt--;
        vis[i] = 1;
      }
    }
    for (int i = 1; i <= n; i++)
      if (vis[i]) printf("%d\n", i);
  }
  return 0;
}
