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 gcdExtended(a, b):

    if a == 0:
        return b, 0, 1

    gcd, x1, y1 = gcdExtended(b % a, a)


    x = y1 - (b // a) * x1
    y = x1

    return gcd,x,y
a,b,c=map(int,input().split())
if a==0:
    if (c%b)==0:
        print(0, -c//b)

    else:
        print(-1)

elif b==0:
    if (c % a) == 0:
        print(-c// a, 0)

    else:
        print(-1)

elif c%(math.gcd(a,b))!=0:
    print(-1)

else:
    gcd,p,q=gcdExtended(a,b)
    print(p*(-c//gcd), q*(-c//gcd))