Competitions
Queue Data Structure
Super minimum
Given n numbers. For every k consecutive numbers find the minimum among them.
Input data
First line contains the numbers n and k (1 ≤ n ≤ 10^6
, 1 ≤ k ≤ n). Second line contains n integers in the range from -32768 to 32767.
Output data
For every k consecutive numbers print the minimum among them.
Examples
Input example #1
11 3 8 764 1 3 85 2 4 5 77 1 5
Output example #1
1 1 1 2 2 2 4 1 1