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()) # about input the variables

def GCD(A,B):
    r = 1
    if B == 0:
        id_ = B
        B = A
        A = id_
    elif A<B and A!=0:
        id_ = B
        B = A
        A = id_
    
    while r is not 0:
        r = A%B        
        A = B
        B = r
        if r == 0: break
    return A

if A<0: a = -1
else: a = 1
if B<0: b = -1
else: b = 1

gcd = GCD(abs(A),abs(B))

if B == 0:
    id_ = B
    B = A
    A = id_

r = C%gcd
if r != 0:
    print(-1)
else:
    u = 1
    U = 0
    v = 0
    V = 1

    R = 1
    while R is not 0:        
        R = abs(A)%abs(B)
        if R == 0: break
        q = abs(A)//abs(B)
        A = B
        B = R
        id_ = U
        U = u-q*U
        u = id_
        id_ = V
        V = v-q*V
        v = id_

    print(-C*a*U//gcd,-C*b*V//gcd)