#include <iostream>
using namespace std;
const int maxn = 1e6 + 5;
const int INF = 2e9;
int segment_tree[3 * maxn];
int a[maxn];

void build_tree(int L, int R, int node) {
    if(L == R) {
        segment_tree[node] = a[L];
    }
    else {
        int middle = (L + R) / 2;
        build_tree(L, middle, 2 * node);
        build_tree(middle + 1, R, 2 * node + 1);
        segment_tree[node] = max(segment_tree[2 * node], segment_tree[2 * node + 1]);
    }
}

//L R i L R j L R
int query(int i, int j, int L, int R, int node) {
    if(R < i or j < L) {
        return -INF;
    }
    if(i <= L and R <= j) {
        return segment_tree[node];
    }
    int middle = (L + R) / 2;
    return max(query(i, j, L, middle, 2 * node), query(i, j, middle + 1, R, 2 * node + 1));
}
int main(){
    ios_base::sync_with_stdio(false);
    int n, k;
    cin >> n >> k;

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

    build_tree(0, n - 1, 1);

    for(int i = 0; i < n - k + 1; i++) {
        cout << query(i, i + k - 1, 0, n - 1, 1) << " ";
    }

    return 0;
}