#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
	vector<int> v;
	int n,k,i,x;
	cin>>n>>k;
	for(i=0;i<n;i++)
	{
		cin>>x;
		v.push_back(x);
	}
	for(i=0;i<=n-k;i++)cout<<*min_element(v.begin()+i,v.begin()+i+k)<<" ";
	cout<<endl;
	for(i=0;i<=n-k;i++)cout<<*max_element(v.begin()+i,v.begin()+i+k)<<" ";
return 0;
}

/**************************************************************
	Problem: 1772
	User: admin
	Language: C++
	Result: Accepted
	Time:4 ms
	Memory:2072 kb
****************************************************************/