#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
const int N = 2e6 + 10;
int a[N];
int n, m;

struct Node{
    int l, r;
    int val;
}tr[N*4-1];

void pushup(int u)  //利用子节点的信息向上更新父节点的信息，本题中需要更新的是父节点的区间的最小值！
{
    tr[u].val = min(tr[u<<1].val, tr[u<<1|1].val);
    return ;
}

void build(int u, int l, int r)
{
    tr[u] = {l, r};
    if (l == r){
        tr[u].val = a[r];
        return ;
    }
    //给当前区间分配左右端点！
    int mid = (l+r) >> 1;
    build(u<<1, l, mid), build(u<<1|1, mid+1, r);
    pushup(u);
}

int query (int u, int l, int r)
{
    if (tr[u].l >= l && tr[u].r <= r)
    {
        return tr[u].val;
    }
    
    int mid = (tr[u].l + tr[u].r) >> 1;
    int res = 0x3f3f3f3f;
    
    if (l <= mid) res = min(res, query(u<<1, l, r));
    if (r > mid) res = min(res, query(u<<1|1, l, r));
    
    return res;
}

int main()
{
    cin >> n >> m;
    for (int i=1; i <= n; i ++)
        cin >> a[i];
    
    build(1, 1, n);
    
    for (int i=1; i <= n; i ++)
    {
        int l = i-m, r = i-1;
        if (l <= 0) cout << 0 << endl;
        else 
            cout << query(1, l, r) << endl;
    }
    
    return 0;
}