//#include<algorithm>
//using namespace std;
#include<stdio.h>
int n,k;
/*short*/ int a[500001];
struct deque{
    int nr,poz;};
deque d[500001];
void solve(){
    int i,st,dr;
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i)
        scanf("%d",&a[i]);
    for(i=st=dr=1; i<=n; ++i){
		d[dr].nr=a[i];
		d[dr++].poz=i;
		if(dr-st>k)
			++st;
		for(; d[st].nr>a[i]; ++st);}
    for(i=st; i<dr; ++i)
        printf("%d ",d[i].nr);}
int main(){
    freopen("secventa.in","r",stdin);
    freopen("secventa.out","w",stdout);
    solve();
    return 0;}