Superminimum

from collections import deque

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

q = deque()
res = []

for i, num in enumerate(nums):
    while q and num < nums[q[-1]]:
        q.pop()
    q.append(i)
    if i >= k-1:
        res.append(str(nums[q[0]]))
        if q[0] == i - k + 1:
            q.popleft()

print(' '.join(res))