#include <iostream>
#include <map>
#include <vector>
#include "algorithm"
#include <queue>
using namespace std;
void build(int v, int l ,int  r, vector <int> & derev,const vector <int> & mas )
{
    if (r-l==1){
        derev[v] = mas[l];
        return;
    }
    int mid = (l+r)>>1;
    build(v*2+1,l , mid, derev, mas);
    build(v*2+2, mid, r, derev, mas);
    derev[v]=  min (derev[v*2+1], derev[v*2+2]);
}
int Quest (int v ,int vl, int vr , int l ,int r,const vector <int> & derev )
{
    if (vl>=l && vr <=r)
        return derev[v] ;
    int mid = (vl+vr)>>1;
    int mx = 2e31;
    if (l<mid)
        mx = Quest(v*2+1, vl, mid, l,r, derev);
    if (r> mid)
        mx = min (Quest(v*2+2,mid, vr, l, r, derev),mx);
    return mx;
}


int main(int argc, const char * argv[]) {
    // insert code here...
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >>n>>k;
    vector <int> g(n);
    vector <int >derev (4*n);
    for (int i = 0 ;i<n;++i)
        cin >>g[i];
    build(0, 0,n , derev, g);
    for (int i = 0 ;i+k-1<n;++i)
        cout << Quest(0, 0, n, i,i+k, derev)<<endl;
}