#include<cstdio>

 #include<cstring>

 using namespace std;

 #define MAXN 1111111

 inline void in(int &ret){

     char c; int sgn;

     while(c=getchar(),c!='-'&&(c<''||c>'')) if(c==EOF) return;

     sgn=(c=='-')?-:; ret=(c=='-')?:(c-'');

     while(c=getchar(),c>=''&&c<='') ret=ret*+(c-'');

     ret*=sgn;

 }

 void out(int x){

     if(x<){

         putchar('-'); out(-x);

         return;

     }

     if(x>) out(x/);

     putchar(x%+'');

 }

 int que[MAXN],idx[MAXN],front,rear;

 int a[MAXN];

 int main(){

     int n,k;

     in(n); in(k);

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

         in(a[i]);

     }

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

         if(front!=rear && idx[front]+k<=i) ++front;

         while(front!=rear && que[rear-]>=a[i]) --rear;

         idx[rear]=i; que[rear]=a[i]; ++rear;

         if(i>=k){

             out(que[front]); putchar(' ');

         }

     }

     putchar('\n');

     front=rear=;

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

         if(front!=rear && idx[front]+k<=i) ++front;

         while(front!=rear && que[rear-]<=a[i]) --rear;

         idx[rear]=i; que[rear]=a[i]; ++rear;

         if(i>=k){

             out(que[front]); putchar(' ');

         }

     }

     return ;

 }