码风不好，请见谅

#include"bits/stdc++.h"
using namespace std;
const int N=1000005;
int n[N];
deque<int>q;
int a,b,c;
int main(void){
	cin>>a>>b;
	for(int i=1;i<=a;i++){
		cin>>n[i];
	}
	for(int i=1;i<=a;i++){
		while(!q.empty()&&n[q.back()]>n[i])
			q.pop_back();
		q.push_back(i);
		if(i>=b){
			while(!q.empty()&&q.front()<=i-b)
				q.pop_front();
			cout<<" "<<n[q.front()];
		}
	}
	cout<<"\n";
	q.clear();
	while(!q.empty())
		q.pop_front();
	for(int i=1;i<=a;i++){
		while(!q.empty()&&n[q.back()]<n[i])
			q.pop_back();
		q.push_back(i);
		if(i>=b){
			while(!q.empty()&&q.front()<=i-b)
				q.pop_front();
			cout<<" "<<n[q.front()];
		}
	}
	cout<<"\n";
	return 0;
}