#include <bits/stdc++.h>
using namespace std;
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
inline int gcd(int a, int b) {
  if (a % b)
    return gcd(b, a % b);
  else
    return b;
}
inline int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
inline int And(int mask, int bit) { return mask & (1 << bit); }
inline int Or(int mask, int bit) { return mask | (1 << bit); }
inline int Xor(int mask, int bit) { return mask & (~(1 << bit)); }
int n, k;
long long a[200100], add, total, r, x;
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
  total = 0;
  add = 0;
  r = 1;
  for (int i = 1; i <= n; i++) {
    x = (r - 1) * (n - add - r) * a[i];
    if (total - x < k)
      printf("%d\n", i), add++;
    else
      total += a[i] * (r - 1), r++;
  }
  return 0;
}
