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:
a, b, c = map(int, input().split())

def exgcd(a, b):
    if b == 0:
        return a, 1, 0
    gcd, x, y = exgcd(b, a % b)
    k = - (a//b)
    xx = y
    yy = x + y*k
    return gcd, xx, yy

# print(exgcd(252, 198))

gcd, x0, y0 = exgcd(a, b)
if c % gcd != 0:
    print(-1)
else:
    k = (-c) // gcd
    print(k*x0, k*y0)