Task

Given an array of integers and a window size w, return the maximum value in each contiguous subarray of length w. The output has length n - w + 1.

Input

• Line 1: two ints n w
• Line 2: n space-separated ints

Output

n - w + 1 space-separated integers on one line.

Example

Input:

6 3
1 3 2 5 4 6

Output:

3 5 5 6

Scaffolding

def window_max(arr: list[int], w: int) -> list[int]: ...