LCM
Problem
Let LCM(x,y) be the minimum positive integer that is divisible by both x and y. For example, LCM(13,37)=481, LCM(9,6)=18.
Given two numbers x and y. Find the LCM(x,y).
Your program should run for T testcases.
Constraints
1<=T<=100000
1<=x,y<=1000000000
Time Limit: 2
Memory Limit: 256
Source Limit:
