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:
#ax+by+c=0
#y=-(c/b+a/b*x)
#For y to be intger->(c+a*x)%b=0
def gcd(a,b):
    if a == 0:
        return 0, 1, b;

    x, y, g = gcd(b % a, a)
    return y - (b // a) * x, x, g

a, b, c = map(int, input().split())
c = -c
x, y, g = gcd(a, b)

if c % g != 0:
    print("-1")
else:
    x *= c // g
    y *= c // g
    print(x,y)