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 Main {
	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in);
		long a = in.nextLong(), b = in.nextLong(), c = -in.nextLong();
		long g = gcd(a, b);
		if (c % g != 0) {
			System.out.println(-1);
			return;
		}
		long[] h = extendedGcd(a, b);
		System.out.println(((h[0]) * c/g) - b + " " + (((h[1]) * c/g) + a));
	}
	
	private static long gcd(long a, long b) {
		if (b==0) return a;
		return gcd(b, a%b);
	}
	
	private static long[] extendedGcd(long a, long b) {
		if (a == 0) return new long[]{0, 1};
		if (b == 0) return new long[]{1, 0};
		
		long[] h = extendedGcd(b, a%b);
		
		return new long[]{h[1], h[0] - h[1] * (a / b)};
	}
}