#include<map>

#include<set>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<cstdio>

#include<cassert>

#include<iomanip>

#include<cstdlib>

#include<cstring>

#include<iostream>

#include<algorithm>

#define pi acos(-1)

#define ll long long

#define mod 1000000007

#define ls l,m,rt<<1

#define rs m+1,r,rt<<1|1

#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-;

const int N=+,maxn=+,inf=0x3f3f3f;

int a[N],q[N];

int minn[N],maxx[N];

int main()

{

 /*   ios::sync_with_stdio(false);

    cin.tie(0);*/

    int n,k;

    while(~scanf("%d%d",&n,&k)){

        for(int i=;i<n;i++)scanf("%d",&a[i]);

        int s=,t=;

        for(int i=;i<n;i++)

        {

            while(s<t&&a[i]>a[q[t-]])t--;

            q[t++]=i;

            if(s<t&&q[t-]-q[s]>=k)s++;

        /*    for(int j=s;j<t;j++)cout<<a[q[j]]<<" ";

            cout<<endl;*/

            minn[i]=a[q[s]];

        }

        s=,t=;

        for(int i=;i<n;i++)

        {

            while(s<t&&a[i]<a[q[t-]])t--;

            q[t++]=i;

            if(s<t&&q[t-]-q[s]>=k)s++;

          /*  for(int j=s;j<t;j++)cout<<a[q[j]]<<" ";

            cout<<endl;*/

            maxx[i]=a[q[s]];

        }

        for(int i=k-;i<n;i++)

            printf("%d%c",maxx[i],i==n-?'\n':' ');

        for(int i=k-;i<n;i++)

            printf("%d%c",minn[i],i==n-?'\n':' ');

    }

    return ;

}