[1934] 최소공배수

#include<iostream>
using namespace std;
int gcd(int m, int n);
int lcm(int m, int n);
int main()
{
	int testcase;
	cin >> testcase;
	while (testcase--)
	{
		int a, b;
		cin >> a >> b;
		cout << lcm(a, b) << endl;
	}
	return 0;
}
int gcd(int m, int n)
{
	if (n == 0)
		return m;
	return gcd(n, m % n);
}
int lcm(int m, int n)
{
	return m * n / gcd(m, n);
}