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

public class P7C
{
	static long x, y; // ax + by = gcd(a, b)
	static long extendedGCD(long a, long b) {
	  if (b == 0) { x = 1; y = 0; return a; }
	  long g = extendedGCD(b, a % b);
	  long z = x - (a / b) * y;
	  x = y; y = z; return g;
	}
	
	public static void main(String[]args) throws Exception
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 
		String input = br.readLine();
		StringTokenizer tk = new StringTokenizer(input); 
		int a = Integer.parseInt(tk.nextToken());
		int b = Integer.parseInt(tk.nextToken());
		int c = Integer.parseInt(tk.nextToken()) *-1;
		
		long gcd = extendedGCD(a,b);
		if(c%gcd==0)
		{
			long div = c/gcd; 
			x*=div;
			y*=div;
			System.out.println(x + " " + y);
		}else
			System.out.println("-1");
	}

}