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:
import sys

def extGCD(a, b, xa, xb):
    if (b == 0):
        return a, xa
    q = a//b
    return extGCD(b, a-q*b, xb, xa-q*xb)

# stdin = open("input.txt", "r")
a, b, c = map(int, input().split())
c = -c

d, x = extGCD(a, b, 1, 0)

if (c%d != 0):
    print(-1)
else:
    x *= c//d
    if (b == 0):
        y = 0
    else:
        y = (c-x*a)//b
    print(x, y)