#include <stdio.h>

 #include <string.h>

 #include <iostream>

 using namespace std;

 #define maxx 1000005

 int num[maxx], inque[maxx], dque[maxx], maxn[maxx], minn[maxx];

 int pre1, pre2, lst1, lst2;

 int n, k;

 int main() {

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

         pre1 = , pre2 = , lst1 = , lst2 = ;

         int cnt = ;

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

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

             // 单增

             while(pre1 < lst1 && num[inque[lst1-]] > num[i])

                 lst1--;

             while(pre2 < lst2 && num[dque[lst2-]] < num[i])

                 lst2--;

             inque[lst1++] = i;

             dque[lst2++] = i;

             while(pre1 < lst1 && i - inque[pre1] +  > k)

                 pre1++;

             while(pre2 < lst2 && i - dque[pre2] +  > k)

                 pre2++;

             if (i +  >= k) {

                 maxn[cnt] = num[inque[pre1]];

                 minn[cnt] = num[dque[pre2]];

                 cnt++;

             }

         }

         for (int i=; i<cnt-; ++i) {

             printf("%d ", maxn[i]);

         }

         printf("%d\n", maxn[cnt-]);

         for (int i=; i<cnt-; ++i) {

             printf("%d ", minn[i]);

         }

         printf("%d\n", minn[cnt-]);

     }

     return ;

 }