思路：模板題

#pragma GCC optimize(2)
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(1e9+7)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
int n,a[1000008],k,s1[1000008],s2[1000008],de[1000008],qw[1000008],xx1,xx2,yy1,yy2;
int main()
{
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    FOR(i,1,n) si(a[i]);
    FOR(i,1,n)
    {
        while(yy1>xx1&&a[i]>=a[de[yy1-1]]) yy1--;
        de[yy1++]=i;
        if(i-k+1>=1)
        {
            s1[i-k+1]=a[de[xx1]];
            while(yy1>xx1&&de[xx1]<=i-k+1) xx1++;
        }
        while(yy2>xx2&&a[i]<=a[qw[yy2-1]]) yy2--;
        qw[yy2++]=i;
        if(i-k+1>=1)
        {
            s2[i-k+1]=a[qw[xx2]];
            while(yy2>xx2&&qw[xx2]<=i-k+1) xx2++;
        }
    }
    FOR(i,1,n-k+1) printf("%d%c",s2[i],i==n-k+1?'\n':' ');
    FOR(i,1,n-k+1) printf("%d%c",s1[i],i==n-k+1?'\n':' ');
    return 0;
}