#include <iostream>
#include <cstring>
#include <cstdio> 
#include <algorithm>
#include <deque>
using namespace std;
const int maxn=1000010;
int a[maxn],Max[maxn],Min[maxn]; 
int main(){
	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]);
	deque<int> q1,q2;//维护最大值 最小值 
	for(int i=1;i<=n;i++){
		while(!q1.empty()&&a[i]>a[q1.back()]) q1.pop_back(); q1.push_back(i);
		while(!q2.empty()&&a[i]<a[q2.back()]) q2.pop_back(); q2.push_back(i);
		while(!q1.empty()&&q1.front()<=i-k) q1.pop_front();
		while(!q2.empty()&&q2.front()<=i-k) q2.pop_front();
		Max[i]=a[q1.front()]; Min[i]=a[q2.front()];
	}
	for(int i=k;i<=n;i++) printf("%d ",Min[i]); printf("\n");
	for(int i=k;i<=n;i++) printf("%d ",Max[i]); printf("\n");
	return 0;
}