B"For some array c , let's denote a greedy subsequence as a sequence of indices p_1 , p_2 , ..., p_l such that 1 <= p_1 < p_2 < ... < p_l <= |c| , and for each i in [1, l - 1] , p_{i + 1} is the minimum number such that p_{i + 1} > p_i and c[p_{i + 1}] > c[p_i] . You are given an array a_1, a_2, ... , a_n . For each its subsegment of length k , calculate the length of its longest greedy subsequence. The first line contains two integers n and k ( 1 <= k <= n <= 10^6 ) -- the length of array a and the length of subsegments. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= n ) -- array a . Print n - k + 1 integers -- the maximum lengths of greedy subsequences of each subsegment having length k . The first number should correspond to subsegment a[1..k] , the second -- to subsegment a[2..k + 1] , and so on. In the first example: In the second example: "...