B'Given an array a of length n and an integer k , find the number of indices 1 <= q i <= q n - k such that the subarray [a_i, ... , a_{i+k}] with length k+1 (not with length k ) has the following property: The first line contains an integer t ( 1 <= q t <= q 1000 ) -- the number of test cases. The first line of each test case contains two integers n , k ( 3 <= q n <= q 2 cdot 10^5 , 1 <= q k < n ) -- the length of the array and the number of inequalities. The second line of each test case contains n integers a_1, a_2, ... , a_n ( 1 <= q a_i <= q 10^9 ) -- the elements of the array. The sum of n across all test cases does not exceed 2 cdot 10^5 . For each test case, output a single integer -- the number of indices satisfying the condition in the statement. In the first test case, both subarrays satisfy the condition: '...