#include<iostream>
#include<cmath>
using namespace std;
const int z=1000010;
int a[z],n,k,minn[z],maxn[z];
void init();
int main(){
	init();
	int l=1,r=k;
	for(int i=1;i<=n-k+1;i++){
		minn[i]=a[i];
		for(int j=l+1;j<=r-1;j++){
			if(a[j]<=minn[i]) minn[i]=a[j];
		}
		maxn[i]=a[i];
		for(int j=l+1;j<=r-1;j++){
			if(a[j]>=maxn[i]) maxn[i]=a[j];
		}
		l++;
		r++;
	}
	for(int i=1;i<=n-k+1;i++){
		cout<<minn[i]<<' ';
	}
	cout<<endl;
	for(int i=1;i<=n-k+1;i++){
		cout<<maxn[i]<<' ';
	}
	return 0;
}
void init(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
}