Given an array A and an integer K, Find the maximum number for each and every contiguous subarray of size K.

INPUT

First line contains two integers N and K denoting the size of array and size of subarray.

Second line contains N integers denoting the array.
 

OUTPUT

Print N-K+1 denoting maximum number in each of the subarrays.

CONSTRAINTS

$1 \leq N \leq 10^5$

$1 \leq K \leq N$

$1 \leq A_i \leq 10^6$