//#include "stdafx.h"

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 using namespace std;

 int n, k, a[], q[];

 void max_value()

 {

     int front = , end = ;

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

     {

         while (a[q[end]] <= a[i] && end >= front)

         {

             end--;

         }

         q[++end] = i;

         while (q[front] < i - k +  && front < end)

         {

             front++;

         }

         if (i >= k - )

             printf("%d ", a[q[front]]);

     }

     puts("");

 }

 void min_value()

 {

     int front = , end = ;

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

     {

         while (a[q[end]] >= a[i] && end >= front)

         {

             end--;

         }

         q[++end] = i;

         while (q[front] < i - k +  && front < end)

         {

             front++;

         }

         if (i >= k - )

             printf("%d ", a[q[front]]);

     }

     puts("");

 }

 int main()

 {

     cin >> n >> k;

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

     {

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

     }

     min_value();

     memset(q, , sizeof(q));

     max_value();

     //system("pause");

     return ;

 }