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 egcd(a, b):
    if b == 0:
        return a, 1, 0
    d, x, y = egcd(b, a % b)
    return d, y, x - y * (a // b)

a, b, c = map(int, input().split())
d, x, y = egcd(abs(a), abs(b))
if c % d != 0:
    print(-1)
    exit()
a //= d
b //= d
c //= d
if a < 0:
    x = -x
if b < 0:
    y = -y
x *= -c
y *= -c
print(x, y)