#include <iostream>
#include <deque>
#include <vector>
using namespace std;
const int maxn = 1e6 + 5;
const int INF = 2e9;

int main(){
    ios_base::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;

    vector<int> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }

    deque<int> dq;
    for(int i = 0; i < n; i++) {
        if(!dq.empty() and dq.front() <= i - k) {
            dq.pop_front();
        }

        while(!dq.empty() and v[dq.back()] <= v[i]) {
            dq.pop_back();
        }

        dq.push_back(i);

        if(i >= k - 1) {
            cout << v[dq.front()] << " ";
        }
    }



    return 0;
}