Aftermath

Once upon a time, you had a nice positive integer $n$.

Since you like division, you quickly found all its positive integer divisors.

Not being a mean guy, you calculated $a$, the arithmetic mean of the divisors of $n$. Surprisingly, this number turned out to be an integer.

Some time passed, and you calculated $h$, the harmonic mean of the divisors of $n$. Even more surprisingly, this number turned out to be an integer, too.

Unfortunately, your memory let you down, and now you remember $a$ and $h$ but don't remember $n$. However, you remember that $n$ did not exceed $10^{15}$.

Your muse suggested to bring the good old times back and restore any value of $n$ matching your records.

The first line of the input contains a single positive integer $a$.

The second line of the input contains a single positive integer $h$.

It is guaranteed that there exists a positive integer $n \le 10^{15}$ such that the arithmetic mean of the divisors of $n$ equals $a$, and the harmonic mean of the divisors of $n$ equals $h$.

Output any positive integer $n$ not exceeding $10^{15}$ that does not contradict the given information.

The arithmetic mean is the sum of a collection of numbers divided by the number of numbers in the collection. For example, the arithmetic mean of 1, 2, 3, 6 is $\frac{1 + 2 + 3 + 6}{4} = 3$.

The harmonic mean is the reciprocal of the arithmetic mean of the reciprocals of the numbers in the collection. For example, the harmonic mean of 1, 2, 3, 6 is $\big( \frac{1^{-1} + 2^{-1} + 3^{-1} + 6^{-1}}{4} \big)^{-1} = 2$.

Thus, in the first example, $n = 6$ satisfies the requirements since its divisors are 1, 2, 3, 6.