1
//666模拟了个优先队列，让这个队列头存当前最值
2
//但队列内存的是位置，便于比较和输出
3
//超出窗口后自动删掉前面多余部分
4
#include <bits/stdc++.h>
5
using namespace std;
6
typedef long long ll;
7
vector<ll> a;
8
int main(){
9
    ll n,k;
10
    cin>>n>>k;
11
    vector<ll> a(n);
12
    for(ll i=0;i<n;i++)cin>>a[i];
13
    deque<ll> lo;
14
    bool fla=false;
15
    for(ll i=0;i<n;i++){
16
        while(!lo.empty()&&a[lo.back()]>a[i])lo.pop_back();
17
        lo.push_back(i);
18
        if(i>=k-1){
19
            while(!lo.empty()&&i-lo.front()>=k)lo.pop_front();
20
            if(fla)cout<<" ";
21
            cout<<a[lo.front()];
22
            fla=true;
23
        }
24
    }
25
    cout<<endl;
26
    lo.clear();
27
    fla=false;
28
    for(ll i=0;i<n;i++){
29
        while(!lo.empty()&&a[lo.back()]<a[i])lo.pop_back();
30
        lo.push_back(i);
31
        if(i>=k-1){
32
            while(!lo.empty()&&i-lo.front()>=k)lo.pop_front();
33
            if(fla)cout<<" ";
34
            cout<<a[lo.front()];
35
            fla=true;
36
        }
37
    }
38
    cout<<endl;
39
    return 0;
40
}