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 gcd(a, b):
	while b != 0: a, b = b, a%b
	return a
	
def getBezout(a, b):
	r1, r2 = a, b
	s1, s2 = 1, 0
	t1, t2 = 0, 1
	q = 0
	while r2 != 0:
		q = r1//r2
		s1, s2 = s2, s1 - q*s2
		t1, t2 = t2, t1 - q*t2
		r1, r2 = r2, r1%r2
	x = s1
	y = t1
	return x, y

def solve(a, b, c):
	if c == 0: return "0 0"
	if a == 0 and b == 0: return "-1"
	if a == 0:
		if c%b: return "-1"
		if (c > 0 and b > 0) or (c < 0 and b < 0):
			return "0 "+str(-(abs(c)//abs(b)))
		return "0 "+str(abs(c)//abs(b))
	if b == 0:
		if c%a: return "-1"
		if (c > 0 and a > 0) or (c < 0 and a < 0):
			return str(-(abs(c)//abs(a)))+" 0"
		return str(abs(c)//abs(a))+" 0"
	signX = 1 if a > 0 else -1
	signY = 1 if b > 0 else -1
	if c > 0:
		signX = -1*signX
		signY = -1*signY
	a, b, c = abs(a), abs(b), abs(c)
	g = gcd(abs(a), abs(b))
	if c%g:
		return "-1"
	a, b, c = a//g, b//g, c//g
	x, y = getBezout(a, b)
	x = signX*c*x
	y = signY*c*y
	return str(x)+' '+str(y)

a, b, c = [int(x) for x in raw_input().split()]
print(solve(a, b, c))