GCD and LCM of two numbers

Problem

Two machines repeat every a and every b minutes. Print the greatest common divisor of a and b, and the least common multiple, which is when they next start together.

Input, output and limits

Input: One line with two integers a and b.
Output: Two integers separated by a space: gcd, then lcm.
Constraints: 1 ≤ a, b ≤ 10^12

Examples

Example

Input

84 36

Output

12 252

GCD 12, LCM 252.

Hints

Try the problem first. Open one hint at a time.

Hint 1

Use math.gcd.

Hint 2

lcm(a, b) equals a // gcd * b.

Write your Python code, run it on the examples and submit it to hidden tests.

Solve in the editor

Prime or noteasy
The single numbermedium
Is it a power of two?easy
The missing numbermedium
Count the set bitseasy

All Python problems

Problem

Input, output and limits

Examples

Hints

More Bit Manipulation & Math problems

Problem

Input, output and limits

Examples

Hints

More Bit Manipulation & Math problems