#2和#7WA了，dalao帮忙看一下

#include<cstdio>
using namespace std;
const int M=1e6+1;
long long n,k,w[M],ma[M],mi[M],p=-0xfff,q=-0xfff,min_=0xffffffff,max_=-0xffffffff,l,r; 

void xy(int t,int l,int r){
	 for(int t=l;t<=r;t++){
	 	if(w[t] < min_){
	 		min_ = w[t];
	 		p=t;
		 }
	 }
	 mi[t]=min_;
	 min_=0xfffffff;
}
void yx(int u,int l,int r){
	for(int u=l;u<=r;u++){
	 	if(w[u] > max_){
	 		max_ = w[u],
	 		q=u;
		 }
	 }
	ma[u]=max_;
	max_=-0xfffffff;
}
int main(){
	scanf("%lld%lld",&n,&k);
	for(int i=1;i<=n;i++)
	  scanf("%lld",&w[i]);
	l=1,r=k;
	for(int i=1;i<=n;++i){
	  if( p < l )
		  xy(i,l,r);
      else {
	    if(w[r] < w[p] )
		  mi[i]=w[r],p=r;
		else mi[i]=w[p];
	  }	
      if( q < l )
    	yx(i,l,r);
      else { 
        if(w[r] > w[q] )	
    	  ma[i]=w[r],q=r;
    	else ma[i]=w[q];
	  }
	  if(l < n-k+1)
    	++l,++r;
	}
	for(int i=1;i<=n-k+1;i++)
	  printf("%lld ",mi[i]);
	printf("\n");
	for(int i=1;i<=n-k+1;i++)
	  printf("%lld ",ma[i]);
	return 0;
}