#include <bits/stdc++.h>
using namespace std;

int n,m;
int a[2000007];

deque <int> q;

int main()
{
    cin >> n >> m;
    for (int i=1;i <= n;i++){
        cin >> a[i];
    }

    for (int i=1;i <= n;i++){
        while (!q.empty() && i-m > q.front())
        {
            q.pop_front();
        }
        if (q.empty()) cout << 0 << endl;
        else cout << a[q.front()] << endl;
        while(!q.empty() && a[i] <= a[q.back()]){
            q.pop_back();
        }
        q.push_back(i);
        
    }

    return 0;
}