A * B = GCD(A, B) * LCM(A, B)

import java.util.Scanner;

public class Main {
    public static void main(String[] args) throws Exception {

        // Input Supply Cable
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();

        for (int i = 0; i < T; i++) {

            // Preprocessing
            int A = sc.nextInt();
            int B = sc.nextInt();

            // Operating LCM
            int result = A*B / GCD(Math.max(A, B), Math.min(A, B));

            // Output Extracting Cable
            System.out.println(result);
        }
    }

    // External Module
    public static int GCD(int Bigger, int Smaller) {
        int r = Bigger % Smaller;

        if (r == 0)
            return Smaller;
        else
            return GCD(Smaller, r);
    }

}

 

-

 

// Operating GCD(1/2)
long GCD = GCD(Math.max(A, B), Math.min(A, B));

// External Module(1/2)
private static long GCD(long B, long S) {
    long r = B % S;
    while (r != 0) {
        r = B%S;
        B = S;
        S = r;
    }
    return Math.abs(B);
}