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 PYTHON):

Solution:
def extended_gcd(a,b):
    global gcd
    if b == 0:
        gcd = a       
        return (1,0)
    else:
        (s,t) = extended_gcd(b,a%b)
        return (t,s - (a/b)*t)

a,b,c = map(int, raw_input().split())
c = c*(-1)
solution = extended_gcd(a,b)
num = 5000000000000000000

if c % gcd != 0:
    print "-1"
else:
    if (-num,-num)<=solution<=(num,num) :
        print solution[0]*(c/gcd) , solution[1]*(c/gcd)
    else:
        print "-1"