#include <stdio.h>
using namespace std;
const int N = 1e6 + 10;
int a[N], q[N];//a[]存储数据,q[]存储下标
int main()
{
int n,k;
scanf("%d %d", &n, &k);
int head=0, tail=-1;//队列头尾指针
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++)
{
if (head<=tail && i - k + 1 > q[head])//队列头元素不满足滑动窗口,超出窗口范围进行出队
{
head++;
}
while (head<=tail && a[q[tail]]>=a[i])//不满足单调队列,类似单调栈则出队
{
tail--;
}
q[++tail] = i;//入队,存储当前值
if (i >= k-1)//满足滑动窗口最低要求,输出当前最小值
{
printf("%d ",a[q[head]]);
}
}
printf("\n");
head = 0, tail = -1;//队列初始化
for (int i = 0; i < n; i++)
{
if (head<=tail && i - k + 1 > q[head])//队列头元素不满足滑动窗口,超出窗口范围进行出队
{
head++;
}
while (head <= tail && a[q[tail]] <= a[i])//不满足单调队列,类似单调栈则出队
{
tail--;
}
q[++tail] = i;//入队,存储当前值
if (i >= k - 1)//满足滑动窗口最低要求,输出当前最大值
{
printf("%d ", a[q[head]]);
}
}
return 0;
}