p, q - prime number
n = p*q - modulo
(e, n) - public parameters of cryptosystem
(d, n) or (d, p,q) - private parameters of cryptosystem

m - message
m^e = c (mod n) - cipher text
m^(e*d) = m (mod n)

So, your task to find d parameter having p,q,e numbers.
I'm guarantee that the number e is valid.

Input: p q e
Output: d

テストケース
------------
IN
5
7
5

Out
5