[브1] 1934 - 최소공배수

int gcd(int a, int b)
{
	int r;

	while (b != 0)
	{
		r = a % b;
		a = b;
		b = r;
	}
	return a;
}

int lcm(int a, int b)
{
	return (a * b) / gcd(a, b);
}

int main()
{
	int t;
	cin >> t;

	while (t--)
	{
		int a, b;
		cin >> a >> b;
		cout << lcm(a, b) << '\n';
	}
}