#include<map>
#include<stack>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define _ 0
#define int long long
#define pii pair <int,int>
#define fx first
#define fy second
using namespace std;
int min(int a,int b,int c){
	int d[3];
	d[0] = a,d[1] = b,d[2] = c;
	sort(d,d + 3);
	return d[0];
}
int max(int a,int b,int c){
	int d[3];
	d[0] = a,d[1] = b,d[2] = c;
	sort(d,d + 3);
	return d[2];
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int n,k;
	cin >> n >> k;
	int a[n],minn[n - k + 1],maxn[n - k + 1];
	for(int i = 0;i < n;i++){
		cin >> a[i];
	}
	for(int i = 0;i < n - k + 1;i++){
		minn[i] = min(a[i],a[i + 1],a[i + 2]);
		maxn[i] = max(a[i],a[i + 1],a[i + 2]);
	}
	for(int i = 0;i < n - k + 1;i++){
		cout << minn[i] << ' ';
	}
	cout << endl;
	for(int i = 0;i < n - k + 1;i++){
		cout << maxn[i] << ' ';
	}
	return ~~(0^_^0);
	cout << "114514";
}