404522: GYM101532 B Array Reconstructing

You are given an array a consisting of n elements a₁, a₂, ..., a_n. Array a has a special property, which is:

You are given the array a with some lost elements from it, each lost element is replaced by -1. Your task is to find all the lost elements again, can you?

The first line contains an integer T, where T is the number of test cases.

The first line of each test case contains two integers n and m (1 ≤ n ≤ 1000) (1 ≤ m ≤ 10⁹), where n is the size of the array, and m is the described modulus in the problem statement.

The second line of each test case contains n integers a₁, a₂, ..., a_n ( - 1 ≤ a_i < m), giving the array a. If the i^th element is lost, then a_i will be -1. Otherwise, a_i will be a non-negative integer less than m.

It is guaranteed that the input is correct, and there is at least one non-lost element in the given array.

For each test case, print a single line containing n integers a₁, a₂, ..., a_n, giving the array a after finding all the lost elements.

It is guaranteed that an answer exists for the given input.

4
5 10
1 2 3 4 5
4 10
7 -1 9 -1
6 7
5 -1 -1 1 2 3
6 10
5 -1 7 -1 9 0

1 2 3 4 5
7 8 9 0
5 6 0 1 2 3
5 6 7 8 9 0

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.