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.Scanner;

public class CF_7CLine {

	static long x, y;

	public static int gcd(int a, int b) {
		if (a == 0) {
			x = 0;
			y = 1;
			return b;
		}
		int g = gcd(b % a, a);
		long x1 = y - x * (b / a);
		long y1 = x;
		x = x1;
		y = y1;
		return g;
	}

	static boolean findSol(int A, int B, int C) {
		int g = gcd(Math.abs(A), Math.abs(B));
		if (C % g != 0)
			return false;
		x *= (C / g);
		y *= (C / g);
		if (A < 0)
			x *= -1;
		if (B < 0)
			y *= -1;
		return true;
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int A = sc.nextInt();
		int B = sc.nextInt();
		int C = sc.nextInt();
		boolean out = findSol(-A, -B, C);
		System.out.println(!out ? -1 : x + " " + y);

	}
}