Time limit: 1s
Memory limit: 32MB
Input:
Output:

## Task

You are given $t$ pairs of positive integers. Find for each pair the greatest common divisor (*gcd*) and the least common multiple (*lcm*).

We define the greatest common divisor (*gcd*) of a pair $(a, b)$ as the largest integer that is a divisor of both $a$ and $b$. We will note this as $x = (a, b)$.

We define the least common multiple (*lcm*) of a pair $(a, b)$ as the smallest integer that is a multiple of both $a$ and $b$. We will note this as $x = [a, b]$.

## Input data

The first line of the input will contain $t$, the number of test cases. The following $t$ lines will contain the two values from each pair, $a$ and $b$.

## Output data

Each of the $t$ lines will have two numbers, representing the *gcd* and the *lcm* of the two numbers.

## Constraints and clarifications

- $1 \leq t \leq 10^5$
- $1 \leq a, b \leq 10^9$
- For tests worth $40$ points, $1 \leq a, b \leq 10^5$.

## Example

`stdin`

```
5
14 8
55 33
63 94
39 27
24 54
```

`stdout`

```
2 56
11 165
1 5922
3 351
6 216
```

### Explanation

$(14, 8) = 2$, $[14, 8] = 56$, etc.