#include<iostream>
#include<cstdio>
#include<queue>
using namespace std;
const int maxn=1000005;
int a[maxn],m_ax[maxn]={0},m_in[maxn]={0};
deque<int>qmax;
deque<int>qmin;
int read();
void Ins(int);
int main(){
	freopen("window.in","r",stdin);
	freopen("window.out","w",stdout);
	int n=read(),k=read();
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<k;i++)Ins(i);
	for(int i=k;i<=n;i++){
		Ins(i);
		if(!qmax.empty()&&qmax.front()<i-k+1)qmax.pop_front();
		if(!qmin.empty()&&qmin.front()<i-k+1)qmin.pop_front();
		m_ax[i]=qmax.front();m_in[i]=qmin.front();
	}
	for(int i=k;i<=n;i++)printf("%d ",a[m_in[i]]);
	printf("\n");
	for(int i=k;i<=n;i++)printf("%d ",a[m_ax[i]]);
	printf("\n");
	fclose(stdin);
	fclose(stdout);
	return 0;
}
int read(){
	int x;char ch;
	while(ch=getchar(),ch<'0'||ch>'9');
	x=ch-'0';
	while(ch=getchar(),ch>='0'&&ch<='9')x=x*10+ch-'0';
	return x;
}
void Ins(int x){
	while(!qmax.empty()&&a[qmax.back()]<=a[x])qmax.pop_back();
	qmax.push_back(x);
	while(!qmin.empty()&&a[qmin.back()]>=a[x])qmin.pop_back();
	qmin.push_back(x);
}