The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.

Input will consist of multiple problem instances. The first line of the input will contain a single integer indicating the number of problem instances. Each instance will consist of a single line of the form m n1 n2 n3 ... nm where m is the number of integers in the set and n1 ... nm are the integers. All integers will be positive and lie within the range of a 32-bit integer.

For each problem instance, output a single line containing the corresponding LCM. All results will lie in the range of a 32-bit integer.

 

 

 

 

 

 

 

 

 

 

 

 

#include<stdio.h>
int p;
int GCD(int a,int b)
{
if(b==0) return a;
return GCD(b,a%b);
}
void LCM(int a,int b)
{
p=a/GCD(a,b)*b;
}
int main()
{
int t,n,i,a;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&p);
for(i=2; i<=n; i++)
{
scanf("%d",&a);
LCM(p,a);
}
printf("%d\n",p);
}
return 0;
}