1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <cmath>
 4 #include <cstring>
 5 #include <string>
 6 #include <iomanip>
 7 #include <iostream>
 8 #include <algorithm>
 9 using namespace std ; 
10 
11 const int maxn = 1000011 ; 
12 struct node{
13     int val,id ; 
14 };
15 int n,k,h,t,tot ; 
16 int Q[maxn],ans[maxn],p[maxn] ; 
17 int a[maxn] ; 
18 
19 int main()
20 {
21     scanf("%d%d",&n,&k) ; 
22     for(int i=1;i<=n;i++) scanf("%d",&a[ i ]) ; 
23     h = 1 ; t = 0 ; 
24     for(int i=1;i<=n;i++) 
25     {
26         while( h<=t&&Q[ t ] >= a[ i ] ) t-- ; 
27         Q[++t] = a[ i ] ; 
28         p[ t ] = i ; 
29         while( h<=t&&p[ t ]-p[ h ]+1 > k) h++ ; 
30         
31         if(i>=k) ans[++tot] = Q[ h ] ;   
32     }
33     for(int i=1;i<=tot;i++) printf("%d ", ans[ i ] ) ; 
34     printf("\n") ;
35 
36     
37     tot = 0 ;
38     h = 1 ; t = 0 ;
39     for(int i=1;i<=n;i++) 
40     {
41         while(h<=t&&Q[t] <= a[ i ]) t-- ; 
42         Q[++t] = a[ i ] ; 
43         p[ t ] = i ; 
44         while(h<=t&&p[t]-p[h]+1>k) h++ ; 
45         if(i>=k) ans[++tot] = Q[ h ] ; 
46     }
47     for(int i=1;i<=tot;i++) printf("%d ",ans[ i ]) ; 
48     
49     
50     
51     return 0 ; 
52 }