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:
def gcdex (a, b):
    if a == 0:
        return 0, 1, b
    x, y, d = gcdex (b % a, a)
    return y - (b / a) * x, x, d
a, b, c = map (int, raw_input ().split ())
M = 5 * 10 ** 18
x, y, d = gcdex (a, b)
if c % d == 0:
    x *= -c / d
    y *= -c / d
    if -M <= x <= M and -M <= y <= M:
        print x, y
    else:   
        print -1
else:
    print -1