#include<cstdio>
#include<algorithm>
#include<deque>
using namespace std;
const int maxn=1000005;
int a[maxn],b[maxn],c[maxn];
deque<int> q1,q2;
void Insert(int x){
	while(!q1.empty()&&a[q1.back()]<=a[x])q1.pop_back();q1.push_back(x);
	while(!q2.empty()&&a[q2.back()]>=a[x])q2.pop_back();q2.push_back(x);
}
int quick()
{
	freopen("window.in","r",stdin);
	freopen("window.out","w",stdout);
	int n,k;scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	if(k>n)k=n;
	for(int i=1;i<=k;i++)Insert(i);
	for(int i=k;i<=n;i++){
		Insert(i);
		if(!q1.empty()&&q1.front()<i-k+1)q1.pop_front();
		if(!q2.empty()&&q2.front()<i-k+1)q2.pop_front();
		b[i]=q1.front();c[i]=q2.front();
	}
	for(int i=k;i<=n;i++)printf("%d ",a[c[i]]);
	printf("\n");
	for(int i=k;i<=n;i++)printf("%d ",a[b[i]]);
	return 0;
}
int mm=quick();
int main(){;}