#include <bits/stdc++.h>
using namespace std;
int n, s[1000005], k;
long long a[1000005];
long long sum = 0;
int pos = 0;
int last[1000005];
vector<int> v;
long long t[1000005];
int get(int l, int r) { return s[r] - s[l - 1]; }
int main() {
  ios_base::sync_with_stdio(NULL);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  int m = n;
  for (int i = 1; i <= n; ++i) {
    int j = i - pos;
    long long cur = sum - (j - 1) * (m - j) * a[i];
    if (cur < k)
      v.push_back(i), ++pos, --m;
    else
      sum += a[i] * (j - 1);
  }
  for (auto x : v) cout << x << " ";
}
