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

#define ll long long

// ---------- Monotonic Deque -----------

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll n, k; cin >> n >> k;
    vector<ll> num(n);
    for(auto &x: num ) cin >> x;

    deque<int> dq;
    vector<int> ans;

    for(int i = 0; i < num.size(); i++){

        if(!dq.empty() && dq.front() == i - k){
            dq.pop_front();
        }

        while (!dq.empty() && num[dq.back()] < num[i])
        {
            dq.pop_back();
        }

        dq.push_back(i);

        if ( i >= k -1){
            ans.push_back(num[dq.front()]);
        }
        
    }

    for(auto x: ans) cout << x << " ";


    
    return 0;
}