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:
/* CS104: line
 * 
 * Author: Mitchell Roger Marshe
 * 
 * CodeForces 
 * Problem: 7C, line
 * Link: http://codeforces.com/contest/7/problem/C
 * ID: tickey
 */

import java.util.Scanner;

public class line {
	private static long x;
	private static long y;
	private static long r;
	
	public static void main(String[] args) {
		long a = 0;
		long b = 0;
		long c = 0;
		x = 0;
		y = 0;
		r = 0;
		
		Scanner scanner = new Scanner(System.in);
		
		a = scanner.nextInt();
		b = scanner.nextInt();
		c = scanner.nextInt();
		
		c = -c;
		gcd(a, b);
		
		if (c % r != 0) {
			System.out.println("-1");
		} else {
			System.out.println(c / r * x + " " + c / r * y);
		}
		
		scanner.close();
	}
	
	public static void gcd(long a, long b) {
		if (b == 0) {
			x = 1;
			y = 0;
			r = a;
			return;
		}
		
		gcd(b, a % b);
		long t = x;
		x = y;
		y = t - a / b * y;
	}
}