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

using ll = long long int;
using P = pair<ll, ll>;
using P3 = pair<int, P>;
using PP = pair<P, P>;
constexpr int INF = 1 << 30;

void solve(){
    int N, L;
    cin >> N >> L;
    vector<int> A(N), ans;
    for(int i=0;i<N;i++){
        cin >> A[i];
    }
    stack<int> fs, bs, num;
    fs.push(INF);
    bs.push(INF);
    for(int i=0;i<L;i++){
        bs.push(min(bs.top(),A[i]));
        num.push(A[i]);
    }
    ans.push_back(bs.top());
    for(int i=L;i<N;i++){
        if(num.size() >= L){
            while(!num.empty()){
                bs.pop();
                fs.push(min(fs.top(),num.top()));
                num.pop();
            }
        }
        num.push(A[i]);
        bs.push(min(bs.top(),A[i]));
        fs.pop();
        ans.push_back(min(bs.top(), fs.top()));
    }
    for(int i=0;i<N-L+1;i++){
        if(i > 0) cout << " ";
        cout << ans[i];
    }
    cout << endl;
}

int main() {
    solve();
    return 0;
}

