#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, k, l, f;
    cin >> n >> k >> l >> f;
    vector<int> temps(n);
    for (int i = 0; i < n; i++) {
        int next;
        cin >> temps[i];
    }

    int start = f * k;
    int end = f * l;
    int start_sum = 0, end_sum = 0;
    for (int i = 0; i < k; i++) {
        start_sum += temps[i];
        if (i >= k - l)end_sum += temps[i];
    }

    int ans = 0;
    bool b = start_sum > start;
    if (b) {
        ans++;
    }

    for (int i = k; i < n; i++) {
        start_sum -= temps[i - k];
        start_sum += temps[i];
        end_sum += temps[i];
        if (i >= l) {
            end_sum -= temps[i - l];
            if (b && end_sum < end) {
                b = false;
                continue;
            }
        }
        if (!b && start_sum > start) {
            b = true;
            ans++;
        }
    }

    cout << ans << "\n";

    return 0;
}