Farmer John wants to host another tournament with (n) cows, where the (i)-th cow has a skill level of (a_i). The following process repeats until there is only one cow in the line. The first cow in the line fights the second cow in the line, and the cow with the higher skill level wins. If there is a tie, the first cow wins. The winning cow's skill level is set to (x + y), where (x) is the skill level of the winning cow and (y) is the skill level of the losing cow. The losing cow leaves the line. However, to maintain accuracy to the real USACOW competition, a cow is able to cheat up to (k) times. This means that even if it loses the match, Farmer John will treat it as if the losing cow won the match, meaning that the losing cow's skill level will be set to (x + y), where (x) is the skill level of the winning cow and (y) is the skill level of the losing cow, and the winning cow will leave the line. A position (x) is good for a cow (i) if cow (i) can be removed from its original position and inserted at index (x) without changing the order of the other cows and be the only cow remaining in the line once the tournament has ended, assuming no other cow cheats. For each cow in the line, calculate the number of good positions for that cow. The first line of the input contains a single integer (t) ((1 \leq t \leq 10^4)) — the number of test cases. The first line of each test case contains two integers (n) and (k) ((2 \le n \le 2 \cdot 10^5), (0 \leq k < n)) — the number of cows and the number of cheats a cow can use. The second line contains (n) integers (a_1, a_2, \ldots, a_n) ((1 \le a_i \le 10^9)) — the skill levels of the cows. It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output (n) integers, where the (i)-th integer denotes the number of good positions for cow (i). For the first test ca