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 PYTHON):

Solution:
from math import *

def gcd(a,b):
    if b == 0:
        return a
    else:
        return gcd(b,a%b)

def ext_gcd(a,b):
    if a%b == 0:
        return (0,1)
    z =()
    z = ext_gcd(b,a%b)
    return (z[1], z[0]-(z[1]*(a/b)))

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

swapped = False
if b == 0:
    tmp = a
    a = b
    b = tmp
    swapped = True
ans2 = ()
ans2 = ext_gcd(a,b)
g = ans2[0]*a + ans2[1]*b
if c%g != 0:
    print -1
else:
    ans = ()
    ans = ext_gcd(a,b)
    factor = -c/g
    x = factor*ans2[0]
    y = factor*ans2[1]
    if swapped == True:
        tmp = x
        x = y
        y = tmp
    print x, y