#include<iostream>
#include<algorithm>
#include<climits>
using namespace std;

const int inf = INT_MAX;
int* d;
int n=1;

void initRMQ(int n) {
    for(int i=0; i<2*n-1; i++) d[i] = inf;
}

void update(int k, int a) {
    k += n-1;
    d[k] = a;
    while(k > 0) {
        k = (k-1)/2;
        d[k] = min(d[k*2+1], d[k*2+2]);
    }
}

int query(int a, int b, int k, int l, int r) {
    if(r <= a || b <= l) return inf;
    if(a <= l && r <= b) return d[k];

    return min(query(a,b,k*2+1,l,(l+r)/2), query(a,b,k*2+2,(l+r)/2,r));
}

int findMin(int a, int b) {
    return query(a, b+1, 0, 0, n);
}

int main() {
    int a, com, n_,l;
    cin >> n_ >> l;
    while(n < n_) n *= 2;
    d = new int[2*n-1];
    initRMQ(n);

    for(int i=0; i<n_; i++) {
        cin >> a;
        update(i,a);
    }

    cout << findMin(0,l-1);
    for(int i=1; i+l <= n_; i++) {
        cout << " " << findMin(i,i+l-1);
    }
    cout << endl;
    delete[] d;
    return 0;
}

