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

# i love you
a, b, c = map(int, input().split())

if b != 0:
    g, x, k = gcdex(a, b)
    if c % g == 0:
        print(x * -c // g, (-c - a * (x * -c // g)) // b)
    else:
        print(-1)
else:
    g, k, y = gcdex(a, b)
    if c % g == 0:
        print(y * -c // g, (-c - b * (y * -c // g)) // a)
    else:
        print(-1)