#include <iostream>
#include <set>
using namespace std;
const int N=1000010;

int f[N];
int ans[N][2];

int main()
{
	//freopen("c.in","r",stdin);
	int n, k;
	scanf("%d%d", &n, &k);
	int i;
	for (i=1; i<=n; i++)
		scanf("%d", &f[i]);

	multiset <int> MS;
	for (i=1; i<=k; i++)
		MS.insert(f[i]);

	ans[k][0] = * MS.begin();
	ans[k][1] = * MS.rbegin();

	for (i=k+1; i<=n; i++)
	{
		MS.insert(f[i]);
		MS.erase(f[i-k]);
		ans[i][0] = * MS.begin();
		ans[i][1] = * MS.rbegin();
	}
	printf("%d", ans[k][0]);
	for (i=k+1; i<=n; i++) printf(" %d", ans[i][0]);
	printf("\n%d", ans[k][1]);
	for (i=k+1; i<=n; i++) printf(" %d", ans[i][1]);
	printf("\n");

	return 0;
}