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 bezout(a,b):
    u,   v,  s,  t = 1, 0, 0, 1
    while b !=0:
        q, r = [(a-a%b)//b, a%b]
        a, b = b, r
        u, s = s, u - q*s
        v, t = t, v - q*t

    return [u, v, a]

def gcd(a, b):
    if a < 0:  a = -a
    if b < 0:  b = -b
    if a == 0: return b
    while b != 0: 
        a, b = b, a%b
    return a

[a,b,c]=list(map(int,input().split()))
g=gcd(a,b)
if(c%g==0):
    a,b,c=a//g,b//g,-c//g
    ans=bezout(a,b)
    print(str(ans[0]*c*ans[2])+' '+str(ans[1]*c*ans[2]))
else:
    print(-1)