#include<cstdio>
#include<cstring>
#include<algorithm>
#include<deque>
#include<iostream>
using namespace std;
const int N=2e6+50;
int n,k;
int a[N];
deque<int>q;
int main(){
	scanf("%d%d",n,&k);
    cout<<0<<endl;
	for(int i=1;i<n;i++){
		scanf("%d",&a[i]);
        if(!q.empty()&&q.front()<i-k+1){
            q.pop_front();
        }
        while(!q.empty()&&a[q.back()]>a[i]){
            q.pop_back();
        }
        q.push_back(i);
        printf("%d\n",a[q.front()]);   
    }
	return 0;
}