Problem: Bholu the Pandit on this New Year wanted to divide his Cuboidal Packaging block into cubes.
But he loves uniformity so he asks you to divide it such a way that all the cubes are of same size and volume of individual cube is as large as possible.

Note: He will utilize whole volume i.e volume of cuboid before dividing is same as sum of volume of all the cubes.

Input
The first input line contains an integer T, the number of testcases. 
Each testcase consist of single line which consist of 3 space separated integers a, b & c representing length, breadth and height of the Cuboidal block.

Output
For each testcase you need to output 2 space separated integers, the length of side of the cube and the number of cubes which could be formed out of this cuboidal packaging block.
As the number of cubes which could be made could be a large number so just output the answer modulus 10^9+7 (1000000007).

Constraints
1 ≤ T ≤ 1000
1 ≤ a,b,c ≤ 10^9

SAMPLE INPUT
2
2 4 6
1 2 3

SAMPLE OUTPUT
2 6
1 6

Explanation

In the 1st testcase a=2, b=4 & c=6.
So length of the side of the cube would be 2 and the number of cubes which would be formed would be 6.
In the 2nd testcase a=1, b=2 & c=3.
So length of the side of the cube would be 1 and the number of cubes which would be formed would be 6.

Solution (in PYTHON):

Solution:
#!/usr/bin/env python

import math
import sys

def gcd(a,b):

    while (b != 0):
        temp = a % b
        a = b
        b = temp
    return abs(a)


def solve(a, b, c):

    x = gcd(a,b)
    y = gcd(b,c)

    ret = gcd(x,y)

    num = ((a/ret) * (b/ret) * (c/ret)) % 1000000007

    return ret, num

testCount = eval(raw_input())

for test in xrange(1, testCount+1):

    inputs = raw_input().split()
    answer = solve(int(inputs[0]), int(inputs[1]), int(inputs[2]))
    print "%d %d" % (answer[0], answer[1])