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.
For each testcase, in a new line, print the value of GCD(LCM(x,y), LCM(x,z)).
1<= T <= 100
1 <= x, y, z <= 106
15 20 100
30 40 400
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.