SP18202 HG - HUGE GCD

**RK** has received a homework assignment to compute the **greatest common divisor** of the two positive integers **A** and **B**. Since the numbers are quite large, the professor provided him with **N** smaller integers whose product is **A**, and **M** integers with product **B**. RK would like to verify his result, so he has asked you to write a program to solve his problem. If the result is more than 9 digits long, output only the **last 9** digits.

N/A

N/A