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:
import math
def ext_gcd(a, b):
    if b == 0:
        return a > 0 and 1 or -1, 0
    x, y = ext_gcd(b, a % b)
    return y, x - a // b * y
A, B, C = map(int, input().split())
C = -C
a2, a3 = ext_gcd(A, B)
t = math.gcd(A, B)
if C % t != 0:
    print(-1)
else:
    print(a2 * C // t, a3 * C // t)