#include <bits/stdc++.h>
using namespace std;
int ToInt(string& s, int len) {
  int r = 0;
  for (int i = 0, max_ = (len); i < max_; ++i) {
    r *= 10;
    r += s[i] - '0';
  }
  return r;
}
int GCD(int a, int b) { return b != 0 ? GCD(b, a % b) : a; }
int LCM(int a, int b) { return a * (b / GCD(a, b)); }
long long Pow(long long n, long long e) {
  if (e == 0) return 1;
  if (e == 1)
    return n;
  else if (e & 1) {
    long long t = Pow(n, e / 2);
    return n * t * t;
  } else {
    long long t = Pow(n, e / 2);
    return t * t;
  }
}
int r[200005];
int main() {
  int N, K;
  scanf("%d %d", &N, &K);
  for (int i = 0, max_ = (N); i < max_; ++i) {
    cin >> r[i];
  }
  vector<int> res;
  long long change = 0, currN = N;
  int id = 0;
  for (int i = 0, max_ = (N); i < max_; ++i) {
    long long tmp = change - (currN - id - 1) * r[i] * max(0, (id));
    if (tmp >= K) {
      change += r[i] * id;
      ++id;
    } else {
      res.push_back(i + 1);
      --currN;
    }
  }
  for (int i = 0, max_ = ((int)(res).size()); i < max_; ++i)
    printf("%d\n", res[i]);
  return 0;
}
