#include <bits/stdc++.h>
using namespace std;
template <class T>
using max_pq = priority_queue<T>;
template <class T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
long long n, k, arr[1000000];
class CSerejaAndContest {
 public:
  void solve(istream& cin, ostream& cout) {
    cin >> n >> k;
    for (int i = 1; i < n + 1; i++) cin >> arr[i];
    long long sum = 0, left = 0;
    for (int i = 1; i < n + 1; i++) {
      long long d = sum - (n - i) * arr[i] * left;
      if (d < k) {
        cout << i << "\n";
      } else {
        left++;
        sum += arr[i] * (left - 1);
      }
    }
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  CSerejaAndContest solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
