Description

Given positive integers $a$, $c$, $p$, ensure that $p$ is $\textbf{prime}$, find $b$ such that:

We say that integers $A, B, C$ have $A \equiv B \pmod{C}$ if and only if there exists an integer $k$ such that $A - B = C \times k$.

Input Format

Input is just one line of three integers $a$, $c$, and $p$ ($1 \leq a, c < p \leq 10^9$), separated by a space, with the meaning as described in the question.

The data guarantees that $p$ is a prime.

Output Format

Output only one integer $b$ ($1 \leq b \leq 10^{18}$). If there are multiple legal answers, you can output any one.

It can be proved that there is at least one solution in the range.

3 5 7

16

14530529 19260817 19491001 

5660025

Hint

For the first sample, we have:

Because: