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:
def gcd(a, b):
	if(b == 0): return 1, 0, a;
	alphap, betap, d = gcd(b, a%b);
	return betap, alphap-a//b*betap, d;

a, b, c = map(int, input().split());
c = -c;
al, be, d = gcd(a, b);
if(c%d == 0):
	x0, y0, lim = c//d*al, c//d*be, 5*10**18;
	if(-lim < x0 < lim and -lim < y0 < lim): print(x0, y0);
	else: print("-1");
else: print("-1");