You are given a sequence of $$$n$$$ non-negative integers $$$a_1, a_2, \ldots, a_n$$$. However, some of its elements may be missing.
Find a way to fill in all the missing elements so that, for any $$$k$$$ consecutive elements, their sum equals $$$s$$$, or report that this is impossible.
The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 10^4$$$): the number of test cases. Then, $$$t$$$ test cases follow.
The first line of a test case contains three integers $$$n$$$, $$$k$$$, $$$s$$$ ($$$1 \leq k \leq n \leq 2 \cdot 10^5$$$, $$$0 \leq s \leq 10^9$$$).
The second line of a test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ ($$$-1 \leq a_i \leq 10^9$$$). If $$$a_i = -1$$$, the $$$i$$$-th element is missing; otherwise, $$$a_i$$$ is the value of that element.
It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.
For each test case, print $$$-1$$$ if it is impossible to fill in all the missing elements properly; otherwise, print $$$n$$$ integers $$$b_1, b_2, \ldots, b_n$$$ ($$$0 \leq b_i \leq 10^9$$$): the filled sequence. If $$$a_i \neq -1$$$ for some $$$i$$$, then $$$b_i = a_i$$$ must hold.
If there are several valid answers, print any. It can be shown that if a solution exists, then there also exists a solution in which all the numbers do not exceed $$$10^9$$$.
48 3 117 -1 -1 -1 -1 -1 -1 15 2 1-1 -1 -1 -1 -16 3 3010 10 10 10 10 102 1 11 2
7 1 3 7 1 3 7 11 0 1 0 110 10 10 10 10 10-1
In the first test case of the example, we can see that any $$$k=3$$$ consecutive elements $$$b_i, b_{i+1}, b_{i+2}$$$ of the filled sequence add up to $$$s = 11$$$.
In the second test case, the filled sequence $$$(0, 1, 0, 1, 0)$$$ can also be a valid answer.
In the third test case, all the elements are already filled in, which is a completely acceptable situation. Each $$$k=3$$$ consecutive elements add up to $$$s=30$$$, making the original sequence a valid answer.
In the fourth test case, the single element $$$a_2$$$ does not equal $$$s = 1$$$, so there are no valid answers.