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:
maxn=5000000000000000000;
minn=-5000000000000000000;
def extgcd(a,b):
	if a == 0: 
		return 0,1;
	x1,y1 = extgcd(b%a,a);
	x = y1-int(b/a)*x1;
	y = x1;
	return x,y;

def gcd(a,b):
	if (a==0): 
		return b;
	return gcd(b%a,a);

def Judge(x,y):
	if x<=maxn and x>=minn and y<=maxn and y>=minn:
		return True;
	return False;

a,b,c = map(long,raw_input().split());
x,y = extgcd(a,b);

g = gcd(a,b);
c=c*-1;
if c%g==0:
	x *= c/g;
	y *= c/g;
	if Judge(x,y):
		print x,y;
	else:
		i=1;
		ka=int(a/g);
		kb=int(b/g);
		while True:
			temx=x+i*ka;
			temy=y+i*kb;
			if Judge(temx,temy):
				print temx,temy;
				break;
			temx=x-i*ka;
			temy=y-i*kb;
			if Judge(temx,temy):
				print temx,temy;
				break;
			i*=2;
else:
	print -1;