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 JAVA):

Solution:
import java.util.*;

public class cf7c {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		long a = in.nextLong();
		long b = in.nextLong();
		long c = -in.nextLong();
		long[] ans = diophantine(a,b,c);
		if(ans == null)
			System.out.println("-1");
		else
			System.out.println(ans[0] + " " + ans[1]);
	}
	//finds the gcd of two numbers
	static long gcd(long a, long b) {
		return b==0?a:gcd(b,a%b);
	}
	
	//provides [x,y] s.t. a*x+b*y = gcd(a,b)
	static long[] extgcd(long a, long b) {
		if(b==0) return new long[]{1,0};
		long[] v = extgcd(b,a%b);
		return new long[]{v[1],v[0]-v[1]*(a/b)};
	}
	
	//provides [x,y] s.t. a*x+b*y = c
	//returns null if there is no solution
	static long[] diophantine(long a, long b, long c) {
//		if(c < 0) {
//			a *= -1;
//			b *= -1;
//			c *= -1;
//		}
		long g = gcd(a,b);
		if(c%g!=0) return null;
		a /= g;
		b /= g;
		c /= g;
		long[] v = extgcd(a,b);
		v[0] *= c;
		v[1] *= c;
		return v;
	}
}