#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<deque>
using namespace std;
void Read();
void Getmin();
void Getmax();
int n,k;
int w[1000001];
int main()
{
	freopen("window.in","r",stdin);
	freopen("window.out","w",stdout);
	memset(w,0,sizeof(w));
	Read();
	Getmin();
	printf("\n");
	Getmax();
	
	fclose(stdin);
	fclose(stdout);
	return 0;
}
 
void Getmax()
{
	deque<int> q;
	for(int i=1;i<k;i++)
	{
		while(!q.empty()&&w[q.back()]<=w[i])
		{
			q.pop_back();
		}
		q.push_back(i);
	}
	for(int i=k;i<=n;i++)
	{
		while(!q.empty()&&w[q.back()]<=w[i])
		{
			q.pop_back();
		}
		q.push_back(i);
		if(!q.empty()&&q.front()<i-k+1)
		{
			q.pop_front();
		}
		printf("%d ",w[q.front()]);
	}
}
 
 
void Getmin()
{
	deque<int> q;
	for(int i=1;i<k;i++)
	{
		while(!q.empty()&&w[q.back()]>=w[i])
		{
			q.pop_back();
		}
		q.push_back(i);
	}
	for(int i=k;i<=n;i++)
	{
		while(!q.empty()&&w[q.back()]>=w[i])
		{
			q.pop_back();
		}
		q.push_back(i);
		if(!q.empty()&&q.front()<i-k+1)
		{
			q.pop_front();
		}
		printf("%d ",w[q.front()]);
	}
}
void Read()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&w[i]);
	}
}