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:
a,b,c = map(int,raw_input().split());

def ext_gcd(a,b):
	if a == 0: return 0,1;
	x1,y1 = ext_gcd(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)

x,y = ext_gcd(a,b)

g = gcd(a,b)

if c%g==0:
	x *= int(-c/g)
	y *= int(-c/g)
	print x,y
else:
	print -1