B'There are n piles of sand where the i -th pile has a_i blocks of sand. The i -th pile is called too tall if 1 < i < n and a_i > a_{i-1} + a_{i+1} . That is, a pile is too tall if it has more sand than its two neighbours combined. (Note that piles on the ends of the array cannot be too tall.) You are given an integer k . An operation consists of picking k consecutive piles of sand and adding one unit of sand to them all. Formally, pick 1 <= q l,r <= q n such that r-l+1=k . Then for all l <= q i <= q r , update a_i gets a_i+1 . What is the maximum number of piles that can simultaneously be too tall after some (possibly zero) operations? The input consists of multiple test cases. The first line contains an integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. The description of the test cases follows. The first line of each test case contains two integers n and k ( 3 <= q n <= q 2 cdot 10^5 ; 1 <= q k <= q n ) -- the number of piles of sand and the size of the operation, respectively. The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^9 ) -- the sizes of the piles. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, output a single integer -- the maximum number of piles that are simultaneously too tall after some (possibly zero) operations. In the first test case, we can perform the following three operations: In the second test case, any operation will increase all piles by 1 unit, so the number of too tall piles will always be 0 . In the third test case, we can increase any pile by 1 unit of sand. It can be shown that the maximum number of too tall piles is 1 . '...