Sliding Board Maximum

We are given a $1\times n$ matrix that contains $n$ integers. A wooden board, which can cover $k$ consecutive numbers, is initially placed on the first $k$ numbers of the matrix. Then, the board is moved one unit to the right repeatedly until its right end coincides with the $n^{th}$ element of the matrix. Before each move (including the initial position), output the maximum value among the numbers currently covered by the board.

inputFormat

The first line contains two integers $n$ and $k$ ($1 \leq k \leq n$). The second line contains $n$ integers representing the matrix values.

outputFormat

Output exactly $n-k+1$ lines. Each line should contain a single integer, which is the maximum among the $k$ numbers covered by the board at that position.

sample

5 3
1 3 2 5 4

3
5
5