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(a,b,x,y):
    if a==0:
        return b
    g=gcd(b%a,a,x,y)
    x[0],y[0]=y[0]-(b//a)*x[0],x[0]
    #print(x,y)
    return g
a,b,c=list(map(int,input().split()))
x,y=[0],[1]
g=gcd(a,b,x,y)
if c%g!=0:
    print(-1)
else:
    c=c//g
    print(x[0]*(-c),y[0]*(-c))