#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<cstdlib>                                                                             

using namespace std;

inline int read()
{
    int ans=0;
    char last=‘ ‘,ch=getchar();
    while(ch<‘0‘||ch>‘9‘) last=ch,ch=getchar();
    while(ch>=‘0‘&&ch<=‘9‘) ans=ans*10+ch-‘0‘,ch=getchar();
    if(last==‘-‘) ans=-ans;
    return ans;
}

const int maxn=1e6+10;
int n,k;
int a[maxn];
struct node
{
    int pos,val;
    node(int a,int b) : pos(a),val(b){}  //构造函数
} ;
deque<node>p,q;

int main()
{
    n=read();k=read();
    for(int i=1;i<=n;i++) 
       a[i]=read();
    
    for(int i=1;i<=n;i++)
    {
        while(!p.empty() &&p.back().val>a[i] ) p.pop_back() ;
        p.push_back(node(i,a[i]));
        while(p.front().pos<=i-k ) p.pop_front() ;
        if(i>=k) printf("%d ",p.front().val );
    }
    printf("\n");
    for(int i=1;i<=n;i++)
    {
        while(!q.empty() &&q.back().val<a[i] ) q.pop_back() ;
        q.push_back(node(i,a[i]));
        while(q.front().pos<=i-k ) q.pop_front() ;
        if(i>=k) printf("%d ",q.front().val );
    }
    return 0;
}