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:
alph, beth, d = 0, 0, 0
def gcd(a, b):
	global alph
	global beth
	global d
	if(b == 0):
		d = a
		alph = 1
		beth = 0
	else:
		gcd(b, a % b)
		temp = alph
		alph = beth
		beth = temp - (a // b) * beth
def main():
	A = [int(i) for i in input().split()]
	a, b , c = A[0], A[1], A[2]
	c *= - 1
	gcd(a, b)
	xc = (c // d) * alph
	yc = (c // d) * beth
	if(c % d != 0):
		print(-1)
	else:
		print(int(xc), int(yc))
main()