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 line {
	static long x1, y1, x2, y2;
	public void run() throws Exception {
		Scanner file = new Scanner(System.in);
		long a = file.nextLong(), b= file.nextLong(), c = file.nextLong();
		x1 = 1; y1 = 0; x2 = 0; y2 = 1;
		if (c == 0) System.out.println(0 + " " + 0);
		else if (b == 0) System.out.println(-c % a == 0?  (-c / a) + " 0" : -1);
		else if (a == 0) System.out.println(-c % b== 0 ? 0 + " " + (-c / b) : -1);
		else {
		long extgcd = ext_gcd(a, b);
		if (c % extgcd != 0) System.out.println(-1);
		else {
			//System.out.println(x2 + " " + y2);
			//System.out.println(x2 + " " + y2);
			long temp = -c / extgcd;
			System.out.println(x2 * temp + " " + (y2 * temp));
		}
		}
	}
	public static long gcd(long a, long b) {
		if (a == 0) return b;
		return gcd(b % a, a);
	}
	public static long ext_gcd(long a, long b) {
		//System.out.println(a + " " + b);
		if (a % b == 0) {
			return b;
		}
		long quo = a / b, rem = a % b;
		long rex = x2 * quo, rey = y2 * quo;
		long rexx = x1 - rex, reyy = y1 - rey;
		x1 = x2; y1 = y2;
		x2 = rexx; y2 = reyy;
		//System.out.println(x2 + " " + y2);
		return ext_gcd(b, a % b);
	}
	public static void main(String[] args) throws Exception {
		new line().run();
	}

}