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 sys
input=sys.stdin.readline
from math import gcd
def lcm(a,b):
    return a*b//gcd(a,b)
def ext_gcd(a,b):
    if b:
        d,y,x=ext_gcd(b,a%b)
        y-=(a//b)*x
        return d,x,y
    return a,1,0
a,b,c=map(int,input().split())
c*=-1
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==0:
    print(-b,a)
else:
    g=gcd(a,b)
    if c%g:
        print(-1)
        exit()
    d,x,y=ext_gcd(a,b)
    r=c//g
    x*=r;y*=r
    if a*x+b*y==c:
        print(x,y)
    else:
        print(-x,-y)