#include <bits/stdc++.h>
using namespace std;
static const int INF = 500000000;
template <class T>
void debug(T a, T b) {
  for (; a != b; ++a) cerr << *a << ' ';
  cerr << endl;
}
int n, k;
int ar[200005];
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) scanf("%d", &ar[i + 1]);
  long long int sum = 0;
  vector<int> res;
  int sub = 0;
  for (int i = 1; i < n + 1; ++i) {
    long long int add = -(n - i) * (long long int)ar[i] * ((i - sub) - 1);
    if (sum + add < k) {
      res.push_back(i);
      ++sub;
    } else {
      sum += ar[i] * (long long int)((i - sub) - 1);
    }
  }
  for (int i = 0; i < res.size(); ++i) printf("%d\n", res[i]);
  return 0;
}
