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


if __name__ == "__main__":
    co = input().split()
    A, B, C = int(co[0]), int(co[1]), int(co[2])
    x, y = 1, 0
    g = ext_gcd(A, B)
    if not C % g:
        print(-x*C//g, -y*C//g)
    else:
        print(-1)