arr = list(map(int,input().strip().split()))
# 求每一项前k个数的最小值
que = []
for i in range(n):
    if len(que) == 0:print(0)
    else:print(arr[que[0]])
    while len(que) > 0 and que[0] <= i - k: que.pop(0)
    while len(que) > 0 and arr[i] <= arr[que[-1]]: que.pop()
    que.append(i)