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:
#!/usr/bin/env python
"""
CodeForces: 5C. Line

The problem is equivalent to Bézout's identity, such that
    a*x + b*y = d
where d = -c.

It can be solved with Extended Euclidean Algorithm.
"""


def main():
    a, b, c = map(int, input().split())
    # First, find a pair of the integers, 'x' and 'y', that satisfies:
    #   a*x + b*y = gcd(a, b)
    # If there is an integer 'm' such that:
    #   m = -c / gcd(a, b)
    # then
    #   a*(m * x) + b*(m * y) + c = 0
    x, x1 = 1, 0
    y, y1 = 0, 1
    while b:
        q = a // b
        a, b = b, a % b
        x, x1 = x1, x - x1 * q
        y, y1 = y1, y - y1 * q
    # Now, 'a' is gcd(a, b), and
    # 'x' and 'y' are Bézout coefficients
    if c % a:
        print(-1)
    else:
        c //= -a
        print(c * x, c * y)


if __name__ == '__main__':
    main()