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