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 gcdex(a, b):
	if b == 0:
		return (a, 1, 0)
	(d1, x1, y1) = gcdex(b, a % b)
	(d, x, y) = (d1, y1, x1 - (a / b) * y1)
	return (d, x, y)
	
a, b, c = [long(i) for i in raw_input().split()]
c *= -1
(d, x, y) = gcdex(a, b)
if c % d == 0:
	x *= c / d
	y *= c / d
	if (-5 * 10 ** 18 <= x <= 5 * 10 ** 18) and (-5 * 10 ** 18 <= y <= 5 * 10 ** 18):
		print x, y
	else: 
		print -1
else:
	print -1