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 {
	static long a, b, c, x, y, x0, y0, gcd;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		a = in.nextLong();
		b = in.nextLong();
		c = in.nextLong();
		c = -1 * c;
		long gcd = exgcd(a, b);
		if( c % gcd != 0 ) {
			System.out.println("-1");
			return;//无解
		}
		long x = c / gcd * x0;
		long y = c / gcd * y0;
		System.out.println(x+" "+y);
	}
	public static long exgcd( long a, long b ) {
		if( b == 0 ) {
			x0 = 1;
			y0 = 0;
			return a;
		}
		long temp = exgcd(b, a%b);
		long t = x0;
		x0 = y0; y0 = t - a / b * y0;
		return temp;
	}
}