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:
__author__ = 'Darren'


def solve():
    a, b, c = map(int, input().split())
    params = extended_euclidean(a, b)
    if c % params[0] != 0:
        print(-1)
    else:
        factor = -c // params[0]
        print(params[1] * factor, params[2] * factor)


def extended_euclidean(m, n):
    r0, r1 = m, n
    x0, x1 = 1, 0
    y0, y1 = 0, 1
    while r1 != 0:
        q = r0 // r1
        r0, r1 = r1, r0 - r1 * q
        x0, x1 = x1, x0 - x1 * q
        y0, y1 = y1, y0 - y1 * q
    return r0, x0, y0


if __name__ == '__main__':
    solve()