n, k = map(int, input().split())
arr = list(map(int, input().split()))

from collections import deque

def max_min(arr, func):
    q = deque()
    for i, v in enumerate(arr, 1):
        while q and q[0][0] <= i - k: q.popleft()
        while q and func(v, q[-1][1]): q.pop()     # v 在前
        q.append((i, v))
        if i >= k: print(q[0][1], end=' ')
    print("")

max_min(arr, lambda x, y:x < y)     # 单调递增队列
max_min(arr, lambda x, y:x > y)     # 单调递减队列