BETA
GCD, LCM and Distributive Property
Submissions: 515   Accuracy:

28.38%

  Difficulty: Basic
     

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.

Input:

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.

Output:

Print the value of GCD(LCM(x,y), LCM(x,z)) for each test case in a new line.


Constraints:

1<= T <=100

1<= x, y, z <=1000000


Example:

Input:

2

15 20 100

30 40 400

Output:

60

120

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.