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 compute():

    def xgcd(b,n):
        x0, x1, y0, y1 = 1, 0, 0, 1
        while n!=0:
            q, b, n = b//n, n, b%n
            x0, x1 = x1, x0 - q*x1
            y0, y1 = y1, y0 - q*y1
        return b, x0, y0

    A, B, C = map(int,input().split())
    if A==0 and B==0:
        return [-1] if C!=0 else [0,0]
    if A==0:
        return [0, -C//B] if abs(-C)%B==0 else [-1]
    if B==0:
        return [-C//A, 0] if abs(-C)%A==0 else [-1]
    g, x, y = xgcd(A,B)
    if abs(-C)%g!=0:
        return [-1]
    d = -C//g
    return [x*d, y*d]

if __name__=="__main__":
    print(' '.join(str(it) for it in compute()))