#include <bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
deque<int> q;
long long a[maxn];
int n,k;
int main() 
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	    cin>>a[i];
    for(int i=1;i<=n;i++)
    {
    	if(q.front()<=i-k)q.pop_front();
    	while(q.size()&&a[q.back()]>=a[i])q.pop_back();
    	q.push_back(i);
    	if(i>=k)cout<<a[q.front()]<<" ";
	}
	q.clear();
	cout<<endl;
	for(int i=1;i<=n;i++)
	{
		if(q.front()<=i-k)q.pop_front();
		while(q.size()&&a[q.back()]<=a[i])q.pop_back();
    	q.push_back(i);
    	if(i>=k)cout<<a[q.front()]<<" ";
	}
	return 0;
}

求助各位大佬，90分，RE一个点（蒟蒻勿喷）