#include<iostream> using namespace std; int t,m,n; int gcd(int n1,int n2) { if(n1<n2)swap(n1,n2); int temp; while(n1%n2) { temp=n2; n2=n1%n2; n1=temp; } return n2; } int main() { cin>>t; while(t--) { _int64 sum; cin>>m>>n; m-=1; sum=n; while(m--) { cin>>n; sum=sum*n/gcd(sum,n);//最小公倍数=两数的积/最大公约数 } printf("%ld\n",sum); } return 0; }