Quack the Duck has a permutation(^{\text{∗}}) (a) of length (n) and an incomplete sequence (b_1,b_2,\ldots,b_n). Each element of (b) is either (-1) or an integer from (1) to (n). Each integer from (1) to (n) appears at most once in (b). Quack hopes to complete (b) into a permutation that commutes with (a). In other words, after replacing every (-1) in (b), the equality (a_{b_i}=b_{a_i}) should hold for every (1 \le i \le n). Ja the Ghost wants to help Quack. Among all possible ways to complete (b), he wants to find the lexicographically smallest(^{\text{†}}) one. Determine whether such a completion exists. If it exists, output the lexicographically smallest valid permutation (b). Otherwise, report that it is impossible. (^{\text{∗}})A permutation of length (n) is an array consisting of (n) distinct integers from (1) to (n) in arbitrary order. For example, (2,3,1,5,4) is a permutation, but (1,2,2) is not a permutation ((2) appears twice in the array), and (1,3,4) is also not a permutation ((n=3) but there is (4) in the array). (^{\text{†}})An array (p) is lexicographically smaller than an array (q) of the same size if and only if the following holds: (p \ne q), and in the first position where (p) and (q) differ, the array (p) has a smaller element than the corresponding element in (q). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains an integer (n) ((1 \le n \le 2 \cdot 10^5)) — the length of the permutation. The second line of each test case contains (n) integers (a_1,a_2,\ldots,a_n) ((1 \le a_i \le n)) — the permutation (a). The third line of each test case contains (n) integers (b_1,b_2,\ldots,b_n) ($$$b_i=-