#include <bits/stdc++.h>
#define speed cin.tie(0); ios::sync_with_stdio(0)
using namespace std;

int N;

vector<int> ranges(const vector<int>& tempS, int K, bool mn) {
    vector<int> v(N - K + 1);
    deque<int> q;

    for (int i = 0; i < N; i++) {
        while (!q.empty() && i - q.front() >= K) q.pop_front();
        while (!q.empty() && (
            mn ? tempS[q.back()] >= tempS[i] : 
            tempS[q.back()] <= tempS[i]
        )) q.pop_back();
        
        q.push_back(i);

        if (i >= K - 1) {
            v[i - K + 1] = tempS[q.front()];
        }
    }
    
    return v;
}

int main() {
    int K, L, F;
    cin >> N >> K >> L >> F;

    vector<int> tempS(N);
    for (int& x : tempS) cin >> x;

    if (N < K || N < L) {
        cout << 0;
        exit(0);
    }

    vector<int> maxS = ranges(tempS, L, 0), minS = ranges(tempS, K, 1);

    for (int x : maxS) cout << x <<' '; 
    cout <<'\n';
    for (int x : minS) cout << x <<' '; 
    cout <<'\n';

    int result = 0;

    bool alert = 0;
    for (int i = 0; i < N - K + 1 && i < N - L + 1; i++) {
        if (!alert && minS[i] > F) {
            alert = 1;
            i += K - 1;
            result++;
        }
        else if (maxS[i] < F) {
            alert = 0;
            i += L - 1;
        }
    }

    cout << result;
}