Give an array A, the index starts from 1.
Now we want to know $B_{i}= \max\limits_{i\nmid j}A_{j} $ , $i \geq 2$.

The first line of the input gives the number of test cases T; T test cases follow.
Each case begins with one line with one integer n : the size of array A.
Next one line contains n integers, separated by space, ith number is $A_{i}$.

Limits
$T \leq 20$
$2 \leq n \leq 100000$
$1 \leq Ai \leq 1000000000$
$\sum{n} \leq 700000$

For each test case output one line contains n-1 integers, separated by space, ith number is $B_{i+1}$.