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:
x0 = 1
y0 = 1
d = 0

def euclides(a, b):
    global x0, y0, d

    if b == 0:
        x0 = 1
        y0 = 0
        d = a  
        return       

    euclides(b, a%b)
    x1 = y0
    y1 = x0 - (a//b)*y0
    x0 = x1
    y0 = y1 

a,b,c = [int(x) for x in input().split()]

euclides(a, b)

if c%d != 0:
    print(-1)
else:
    x_sol = -c*x0//d
    y_sol = -c*y0//d

    if -5*(10**18) <= x_sol and x_sol <= 5*(10**18) and -5*(10**18) <= y_sol and y_sol <= 5*(10**18):
         print("{} {}".format(x_sol, y_sol))
    else:
       print(-1)