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 extendedGCD(a, b):
    if b == 0:
        x = 1
        y = 0
        return x, y, a
    x, y, g = extendedGCD(b, a % b)
    z = x - (a // b) * y
    return y, z, g

A, B, C = (int(x) for x in input().split())
if A == 0 and B == 0:
    if C == 0:
        print(1, 1)
    else:
        print(-1)
elif A == 0:
    if C % B == 0:
        print(1, (-C // B));
    else:
        print(-1)
elif B == 0:
    if C % A == 0:
        print((-C // A), 1)
    else:
        print(-1)
else:
    x, y, gcd = extendedGCD(A, B)
    X = x * -C // gcd
    Y = y * -C // gcd
    if -5e18 <= X <= 5e18 and -5e18 <= Y <= 5e18 and A * X + B * Y + C == 0:
        print(X, Y)
    else:
        print(-1)