e-olymp
Problems

Modular division

Modular division

Given three positive integers a, b and n. Find a / b mod n. So you must fund such x that b * x = a mod n.

Input

Three positive integers a, b, n (n2 * 109, 1a, b < n). It is known that n is prime.

Output

Print the value of a / b mod n.

Time limit 1 second
Memory limit 128 MiB
Input example #1
3 4 7
Output example #1
6
Input example #2
4 8 13
Output example #2
7
Author Michael Medvedev