Given an array A of size N, construct a Product Array P (of same size) such that P is equal to the product of all the elements of A except A[i].
The first line of input contains an integer T denoting the number of test cases. T testcases follow. Each testcase contains two lines of input. The first line is N. The second line contains N elements separated by spaces.
For each testcase, print the Product array P.
1 <= T <= 10
1 <= N <= 1000
1 <= Ai <= 20