#include<cstdio>

#include<algorithm>

using namespace std;

const int maxn=1e6+;

int n,k,head,tail;

int a[maxn],q[maxn],p[maxn];

int main(){

    scanf("%d%d",&n,&k);

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

        scanf("%d",&a[i]);

    head=,tail=;

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

        while(tail>=head&&q[tail]>=a[i])

            --tail;

        q[++tail]=a[i];

        p[tail]=i;

        while(p[head]<=i-k)

            ++head;

        if(i>=k) printf("%d ",q[head]);

    }

    printf("\n");

    head=,tail=;

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

        while(tail>=head&&q[tail]<=a[i])

            --tail;

        q[++tail]=a[i];

        p[tail]=i;

        while(p[head]<=i-k)

            ++head;

        if(i>=k) printf("%d ",q[head]);

    }

    printf("\n");

    return ;

}