#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
int QuickRead() {
	int zf = 1, ret = 0;
	char ch = getchar();
	while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
	if (ch == '-') zf = -1;
	else ret = ch - '0';
	ch = getchar();
	while (ch >= '0' && ch <= '9') {
		ret = ret * 10 + ch - '0';
		ch = getchar();
	}
	return ret*zf;
}
int n,k;
const int maxn=1000001;
int a[maxn];
int b[maxn],c[maxn];
deque<int> q1,q2;
void charu(int x)
{
	while(!q1.empty()&&a[x]>=a[q1.back()])q1.pop_back();q1.push_back(x);
	while(!q2.empty()&&a[x]<=a[q2.back()])q2.pop_back();q2.push_back(x);
}
int main()
{	
	freopen("window.in","r",stdin);freopen("window.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)a[i]=QuickRead();
	for(int i=1;i<k;i++)charu(i);
	for(int i=k;i<=n;i++)
	{
		charu(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]]);
	cout<<endl;
	for(int i=k;i<=n;i++)printf("%d ",a[b[i]]);
	return 0;
	
}