Sliding Window Minimum

You are given $N$ numbers $A_1, A_2, \dots, A_N$ and a number $L$.

Let $D_i$ be the minimum of $A_{i-L+1}$ through $A_i$. That is, $D_i$ is the smallest value in the window of length $L$ that ends at position $i$. No $A$ with an index of $0$ or less exists, so ignore those indices when computing $D_i$. When $i < L$ the window is shorter, and $D_i$ is the minimum of $A_1$ through $A_i$.

Write a program that prints $D_1$ through $D_N$.

The first line contains $N$ and $L$. ($1 \le L \le N \le 5\,000\,000$)

The second line contains the $N$ numbers $A_i$, separated by spaces. ($-10^9 \le A_i \le 10^9$)

On the first line, print $D_1$ through $D_N$ in order, separated by spaces.