#include <iostream>
#include <queue>
#define ll long long

using namespace std;

ll db;
int main()
{
    ll n, k, l, f;
    cin >> n >> k >> l >> f;
    vector <ll> a(n+1);
    for (ll i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    bool k1 = false, l1 = true;
    for (ll i = 1; i <= n; ++i)
    {
        if (k1 == 1)
        {
            for (ll j = i; j <= (i + l) - 1; ++j)
            {
                if (a[j] < f)
                {
                    l1 = true;
                }
                else
                {
                    l1 = false;
                    break;
                }
            }
            if (l1 == 1)
            {
                k1 = false;
                i += l - 1;
            }
        }
        if (a[i] > f && l1 == 1)
        {
            for (ll j = i; j <= (i + k) - 1; ++j)
            {
                if (a[j] > f)
                    k1 = true;
                else
                {
                    k1 = false;
                    break;
                }
            }
            if (k1 == 1)
            {
                ++db;
                i += k - 1;
            }
        }
    }
    cout << db;

    return 0;
}