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

ABC = [int(i) for i in input().split()]
A = ABC[0]
B = ABC[1]
C = ABC[2]

def gcd_euclidean(a, b):
  r = a % b
  if r == 0:
    return b, 0, 1
  else:
    g, x, y =  gcd_euclidean(b, r)
    return g, y, x-(a//b) * y
max_num = int(5e18)


if A == 0:
    #y = 3 etc
    if C % B == 0:
        print(0, -C//B)
    else:
        print(-1)
elif B == 0:
    #x = 3 etc
    if C % A == 0:
        print(0, -C//A)
    else:
        print(-1)
else:
    g, x, y = gcd_euclidean(A, B)
    if C % g == 0:
        k = C // g
        kx = -k * x
        ky = -k * y
        if abs(kx) > max_num or abs(ky) > max_num:
            print(-1)
        else:
            print(kx, ky)
    else:
        print(-1)