Given three integers x, y, z, the task is to compute the value of GCD(LCM(x,y), LCM(x,z)).
Where, GCD = Greatest Common Divisor, LCM = Least Common Multiple.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integers x, y and z.
Print the value of GCD(LCM(x,y), LCM(x,z)) for each test case in a new line.
1<= T <=100
1<= x, y, z <=1000000
15 20 100
30 40 400