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.*;
import java.util.*;
 

public class Main {
	
	static long X, Y, GCD;	
	static long gcdEuc(long A, long B){
		if(B == 0){
			X = 1;
			Y = 0;
			return A;
		} else {
			GCD = gcdEuc(B, A % B);
			long swap = X;
			X = Y;
			Y = swap - A / B * Y;
		}
		
		return GCD;
	}
	
	public static void main(String[] args) throws java.lang.Exception {
		BufferedReader kek = new BufferedReader(new InputStreamReader(System.in));
		//Scanner skek = new Scanner(System.in);
		PrintWriter outkek = new PrintWriter(System.out);

		String[] input = kek.readLine().split(" ");
		long A = Integer.parseInt(input[0]), B = Integer.parseInt(input[1]), C = Integer.parseInt(input[2]);
		long gcdRes = gcdEuc(A,B);
		
		if(C % gcdRes != 0){
			outkek.println(-1);
		} else {
			A /= gcdRes;
			B /= gcdRes;
			C /= gcdRes;
			
			long fin1 = -C * X, fin2 = Y * -C;
			
			outkek.println(fin1 + " " + fin2);
		}
		
		kek.close();
		outkek.close();
	}	
	
}