#include <bits/stdc++.h>
using namespace std;
int n,w,a[1000010];
deque<int> q;
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	scanf("%d%d",&n,&w);
	for (int i = 1; i <= n; i++){
		scanf("%d",&a[i]);
	}
	for (int i = 1; i <= n; i++){
		while (!q.empty() && q.front() <= i-w){
			q.pop_front();
		}
		while (!q.empty() && a[q.back()] >= a[i]){
			q.pop_back();
		}
		q.push_back(i);
		if (i >= w){
			printf("%d ",a[q.front()]);
		}
	}
	q.clear();
	printf("\n");
	for (int i = 1; i <= n; i++){
		while (!q.empty() && q.front() <= i-w){
			q.pop_front();
		}
		while (!q.empty() && a[q.back()] <= a[i]){
			q.pop_back();
		}
		q.push_back(i);
		if (i >= w){
			printf("%d ",a[q.front()]);
		}
	}
	printf("\n");
	return 0;
}