Problem: A line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from  - 5·1018 to 5·1018 inclusive, or to find out that such points do not exist.

Input

The first line contains three integers A, B and C ( - 2·109 ≤ A, B, C ≤ 2·109) — corresponding coefficients of the line equation. It is guaranteed that A2 + B2 > 0.

Output

If the required point exists, output its coordinates, otherwise output -1.

Examples

Input

2 5 3


Output

6 -3

Solution (in PYTHON3):

Solution:
def bezout(a, b):
    if not b:
        return (1, 0, a)
    y, x, g = bezout(b, a % b)
    return (x, y - (a // b) * x, g)

a, b, c = map(int, input().split())
x, y, gcd = bezout(a, b)
if c % gcd: 
    print(-1)
else:
    print(-x * c // gcd, -y * c // gcd)