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:
def gcd(x,y):
    if x % y == 0:
        return y
    else:
        return gcd(y,x%y)

def bezout(x,y):
    if x % y == 0:
        return (0,1)
    else:
        t,s = bezout (y,x%y)
        return (s,t-(x//y)*s)
        
a,b,c = map(int,input().split())
if a == 0:
    if c % b == 0:
        print("%d %d" % (0,-c//b))
    else:
        print(-1)
    exit()
if b == 0:
    if c % a == 0:
        print("%d %d" % (-c//a,0))
    else:
        print(-1)
    exit()
if c % gcd(a,b) != 0:
    print(-1)
else:
    x,y = bezout(a,b)
    m = -c//gcd(a,b)
    print("%d %d" % (m*x,m*y))