Line

Line

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·1018inclusive, 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

题解：给方程Ax + By + C = 0.  其中A，B，C为已知， 求x，y。扩展欧几里得的模板题

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll long long
void gcd(ll a,ll b,ll& d,ll& x,ll& y)
{
	if(!b)
	 {
	 	d=a;
	 	x=1;
	 	y=0;
	 }
	 else
	 {
	 	gcd(b,a%b,d,y,x);
	 	y-=x*(a/b);
	 }
}
int main()
{
	ll a,c,b,d,x,y;
	while(~scanf("%lld%lld%lld",&a,&b,&c))
	{
		gcd(a,b,d,x,y);
		if(c%d!=0)
		    printf("-1\n");
		else
	    	printf("%lld %lld\n",-x*(c/d),-y*(c/d));
	}
}