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.lang.*;
import java.io.*;
import java.math.*;
import java.math.BigInteger;

public class Main {
	final int INF = 1000000000;
	final int MAXN = 1111;
	
	Scanner input = new Scanner(System.in);
	BufferedReader inp = new BufferedReader(new InputStreamReader(System.in));
	PrintWriter out = new PrintWriter(System.out);
	StringTokenizer ST;
	
	public static void main(String[] args) throws IOException{
		new Main().run();
	}
	
	void run() throws IOException {
		long a, b, c;
		a = input.nextLong();
		b = input.nextLong();
		c = input.nextLong();
		long[] res = new long[2];
		long g = gcd(a, b, res);
		if (c % g != 0) {
			out.println(-1);
		} else {
			out.println(res[0] * (-c / g) + " " + res[1] * (-c / g));
		}
		out.close();
	}	
	
	long gcd(long a, long b, long[] xy) {
		if (a == 0) {
			xy[0] = 0;
			xy[1] = 1;
			return b;
		}
		long[] temp = new long[2];
		long d = gcd(b % a, a, temp);
		xy[0] = temp[1] - (b / a) * temp[0];
		xy[1] = temp[0];
		return d;
	}
}