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 sys,math

I=sys.stdin.readline

a,b,c=map(int,I().split())


def extendedGcd(a,b):
	if b==0:
		return a,1,0
	g,x1,y1=extendedGcd(b,a%b)
	x=y1
	y=x1-(a//b)*y1
	return g,x,y

if c%math.gcd(a,b):
	print(-1)
else:
	d,x,y=extendedGcd(a,b)
	print(x*(-c//d),y*(-c//d))