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 C_Line {
	static long n;
	static long m;

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		long A = in.nextLong();
		long B = in.nextLong();
		long C = in.nextLong();

		// normalization
		long a = A, b = B, c = -C;
		EEA(a, b);
		long gcd = a * n + b * m;

		if (c % gcd != 0) {
			System.out.println(-1);
		} else {
			long x0 = (n * c) / gcd;
			long y0 = (m * c) / gcd;
			System.out.println(x0 + " " + y0);
		}
	}

	// extended ecluid algorithm
	public static void EEA(long a, long b) {

		long x = 0, y = 1, lastx = 1, lasty = 0, temp;
		while (b != 0) {
			long q = a / b;
			long r = a % b;

			a = b;
			b = r;

			temp = x;
			x = lastx - q * x;
			lastx = temp;
			temp = y;
			y = lasty - q * y;
			lasty = temp;
		}
		// System.out.println("Roots x : " + lastx + " y :" + lasty);

		n = lastx;
		m = lasty;
	}

}