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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class Main{
	public static StreamTokenizer sc=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
	public static int nextint() throws IOException {
		sc.nextToken();
		return (int)sc.nval;
	}
	public static String nextLine() throws IOException{
		sc.nextToken();
		return sc.sval;
	}
	public static int gcd(int a,int b) {
		if(b==0) {
			return a;
		}else {
			return gcd(b,a%b);
		}
	}
	public static int extgcd(int a,int b,Long x,Long y) {
		int d=a;
		if(b==0) {
			x.v=1;
			y.v=0;
		}else {
			d=extgcd(b,a%b,y,x);
			y.v-=(a/b)*x.v;
		}
		return d;
	}
	static class Long{
		long v;
	}
	public static void main(String args[]) throws IOException {
		PrintWriter out=new PrintWriter(System.out);
		int a=nextint();
		int b=nextint();
		int c=nextint();
		Long x = new Long(),y=new Long();
		int k=extgcd(a,b,x,y);
		if((-c)%k!=0) {
			out.print(-1);
		}else {
			out.print((-c)/k*x.v+" "+(-c)/k*y.v);
		}
		out.flush();
		out.close();
	}
}