#2: 10 5 8 5 18 12 18 12 10 7 15 1

#include <iostream>
using namespace std;
int main()
{
	long int N,m,max,i,j;
	cin>>N>>m;
	int n[N+5];
	for (i=-m;i<=0;i++)
	{
		n[i]=30000005;
	}
	for (i=1;i<=N;i++)
	{
		cin>>n[i];
		
	}
    cout<<"0"<<endl;
    for (i=2;i<=N;i++)
    {
        max=30000005;
            for (j=i-m;j<i;j++)
            {
                if (n[j]<max)
                max=n[j];
            }
            cout<<max<<endl;
    }
	return 0;
}```