You are given a cuboid with integer dimensions: \(L, B, H\). You wish to split the entire cuboid into cubes of equal dimension. What is the minimum number of cubes which can be obtained?

Input Format

First-line consists of T, the number of test cases.

Next T lines consist of 3 space-separated integers: L, B, and H.

Output Format

Print T lines, each line consisting of the minimum number of cubes that can be obtained.

Constraints

\(1 \leq T \leq 1000 \\ 1 \leq L, B, H \leq 1000\)