From Euclid it is known that for any positive integers and there exist such integers and that , where is the greatest common divisor of and . The problem is to find for given and corresponding and .
Each line contains two positive integers and .
For each test case print in a separate line three integers and . If there are several such and , print the pair for which is minimal. If there also exist multiple answers, print the pair with minimum value of .