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.*;

public class CF7C {
	static long[] gcdxy(long a, long b) {
		long d0 = a, d1 = b;
		long x0 = 1, x1 = 0;
		long y0 = 0, y1 = 1;
		long t;
		while (d1 != 0) {
			long q = d0 / d1;
			t = d0 - d1 * q;
			d0 = d1;
			d1 = t;
			t = x0 - x1 * q;
			x0 = x1;
			x1 = t;
			t = y0 - y1 * q;
			y0 = y1;
			y1 = t;
		}
		return new long[] {d0, x0, y0};
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long a = sc.nextLong();
		long b = sc.nextLong();
		long c = sc.nextLong();
		long[] dxy = gcdxy(a, b);
		long d = dxy[0];
		if (c % d == 0) {
			long x = dxy[1];
			long y = dxy[2];
			x *= -c / d;
			y *= -c / d;
			System.out.println(x + " " + y);
		} else
			System.out.println(-1);
	}
}