#include<bits/stdc++.h>
using namespace std;
const int N=2e6+10;
deque<int>q;
int a[N];
//queue<int>q;
int main()
{
  int n,m;
   scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=n;i++)
    {
        if(i!=n)   
     while(!q.empty()&&a[q.back()]>a[i])q.pop_back();//
      
        while(!q.empty()&&q.front()<=i-m-1)q.pop_front();
//         cout<<a[q.front()]<<" ";
            if(i==1)
               printf("0\n");
           else
              printf("%d\n",a[q.front()]);
              q.push_back(i);
    }
    return 0;
}