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 Math
a,b,c = map(int, input().split())
# A= abs(a)
# B = abs(b)
# def egcd(A,B):
# 	x,y,u,v = 0,1,1,0
# 	while A!= 0:
# 		q = B//A
# 		m,n = x- u*q, y-v*q
# 		B,A,x,y,u,v = A,B%A,u,v,m,n
# 	return x,y
# def gcd(A, B):
# 	if B == 0:
# 		return A
# 	return gcd(B, A%B)
# if(c % gcd(A,B) != 0):
# 	print(-1)
# else:
# 	k = -1 * (c// gcd(A,B))
# 	X,Y = egcd(A,B)
# 	print(k*X , k*Y)
r0 , r1 , s0, s1 , t0, t1 = a, b, 1, 0, 0, 1
while r1 :
	q, r2 = divmod(r0,r1)
	# its a function that returns a tuple containing quotient of first and the
	# remainder of the other
	q, r2 = r0//r1 ,r0 % r1
	r0 , r1 = r1, r2
	s0, s1 = s1, s0 - q*s1
	t0 , t1 = t1, t0 - q*t1
if c % r0:
	print(-1)
else:
	print(s0*-c//r0, t0 * -c//r0)