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):
	x=0
	lastx=1
	y=1
	lasty=0
	while b!=0:
		q= a/b
		a,b=b,a%b
		x,lastx=lastx-q*x,x
		y,lasty=lasty-q*y,y
	ans=[lastx]
	ans+=[lasty]
	return ans

lis=raw_input().split()
a=int(lis[0])
b=int(lis[1])
c=int(lis[2])
gcda=gcd(a,b)
gcda,gcdb=gcda[0],gcda[1]
if c%(a*gcda+b*gcdb)!=0:
	print -1
else:
	zarib=c/(a*gcda+b*gcdb)
	gcda*=zarib
	gcdb*=zarib
	print str(-gcda)+" "+str(-gcdb)