#include <iostream>
#include <vector>
using namespace std;

int main() {
    //输入数据
    int n, k;
    cin >> n >> k;
    vector<int> a;//接受数组
    for(int i = 0; i < n; i++){
        int tmp;
        cin >> tmp;
        a.push_back(tmp);
    }
    //双指针遍历序列a,同时用loc指针记录历史最大值位置
    int loc = -1;
    int left = 0;
    int right = k - 1;
    while(right < n){
        int max = 0;//存储最大值
        if(loc >= left){//loc还在窗口内只需要比较最新的值和loc指向的值的大小并更新max和loc的值  
           max = a.at(loc);
           if(a.at(right) > max){
              max = a.at(right);
              loc = right;
           }
        }
        else{//loc不在窗口内就遍历新窗口获取max值并更新loc值
            for(int j = left; j <= right; j++){
                if(a.at(j) > max){
                    max = a.at(j);
                    loc = j;
                }
            }
        }
        cout << max << " ";
        left++;
        right++;
    }
    cout << endl;
    return 0;
}
// 64 位输出请用 printf("%lld")