#include <bits/stdc++.h>

using namespace std;
int n,k,l,f;
int a[100001],b[100001],s;
bool sz=0;

void be() {
    ifstream g("be.in");
    cin>>n>>k>>l>>f;
    int x;
    for (int i=1; i<=n; i++) {
        cin>>x;
        if (x>f) a[i]=a[i-1]+1;
        if (x<f) b[i]=b[i-1]+1;
    }
    for (int i=1; i<=n; i++) cout<<a[i]<<" ";
    cout<<endl;
    for (int i=1; i<=n; i++) cout<<b[i]<<" ";
    cout<<endl;
}

int main()
{
    be();
    for (int i=1; i<=n; i++) {
        if (a[i]>=k) {
            s++;
            sz=1;
            while (b[i]<l) i++;
        }
    }
    cout<<s;
    return 0;
}