human
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
 Give me a Python code 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?
assistant
#Here is Python code 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.

def main():
    [A, B, C] = map(int, raw_input().split())

    def ext_gcd(a, b):
        if b == 0:
            return [a, 1, 0]
        else:
            g = ext_gcd(b, a % b)
            return [g[0], g[2], g[1] - a / b * g[2]]
    def sgn(x):
        if x == 0:
            return 0
        else:
            return -1 if x < 0 else 1

    g = ext_gcd(abs(A), abs(B))
    if C % g[0] != 0:
        print -1
    else:
        C = -C / g[0]
        print g[1] * C * sgn(A), g[2] * C * sgn(B)

if __name__ == '__main__':
    main()