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.io.PrintWriter;
import java.util.Scanner;

public class C7 {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		long A = in.nextLong(), B = in.nextLong(), C = -in.nextLong();
		long[] GCD = extended_gcd(A, B);
		long G = A*GCD[0] + B*GCD[1];
		
		if (C%G != 0) out.println("-1");
		else {
			long X = GCD[0]*(C/G);
			long Y = GCD[1]*(C/G);
			out.println(X + " " + Y);
		}
		
		out.flush();
	}

	static long[] extended_gcd(long a, long b) {
		if (b == 0) return new long[]{1, 0};
		else if (a%b == 0) return new long[]{0, 1};
		else {
			long[] res = extended_gcd(b, a%b);
			return new long[]{res[1], res[0] - res[1]*(a/b)};
		}
	}
}