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 sys
def gcd(a,b):
    LT = []
    while b > 0:
        if a%b != 0:
            LT.append([1,-(a//b)])
        a, b = b ,a%b
    return LT, a
A,B,C = map(int, input().split())
if B <= 0:
    A = -1 * A
    B = -1 * B
    C = -1 * C
if A == 0 and B != 0:
    y = -C//B
    if C % B != 0:
        print(-1)
    else:
        print("{} {}".format(0,y))
    sys.exit()
elif B == 0 and A != 0:
    x = -C//A
    if C % A != 0:
        print(-1)
    else:
        print("{} {}".format(x,0))
    sys.exit()
elif B == 0 and A == 0:
    if C  != 0:
        print(-1)
    else:
        print("{} {}".format(0,0))
    sys.exit()
lt, dt = gcd(A, B)
n = len(lt)
if n == 0:
    if -C % A == 0 and -C%B != 0:
        print("{} {}".format(-C//A,0))
    elif -C%B == 0 and -C%A != 0:
        print("{} {}".format(0,-C//B))
    elif -C%B == 0 and -C%A == 0:
        print("{} {}".format(0,-C//B))
    sys.exit()
for i in range(n-1, 0,-1):
    lt[i-1][0] = lt[i-1][0]*lt[i][1]
    lt[i-1][1] = lt[i-1][1]*lt[i][1] + lt[i][0]
x = -lt[0][0]*C//dt
y = -lt[0][1]*C//dt 
if (x * A + y *B + C) != 0:
    print(-1)
else:
    print("{} {}".format(x,y))