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 CF7C {
	static long x;
	static long y;
	static long gcd;
	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(bf.readLine());
		long A = Long.parseLong(st.nextToken());
		long B = Long.parseLong(st.nextToken());
		long C = Long.parseLong(st.nextToken());
		long gcda_b = Euclid(A,B);
		if (C % gcda_b!=0){
			System.out.println("-1");
		}
		else{
			A = A/gcda_b;
			B = B/gcda_b;
			C = C/gcda_b;
			System.out.println(-C*x + " " + y*-C);
		}
	}
	public static long Euclid(long a,long b){
   	 if(b==0){
   		 x=1;
   		 y=0;
   		 return a;
   	 }
   	 else{
   		 gcd=Euclid(b,a%b);
   		 long temp=x;
   		 x=y;
   		 y=temp-a/b*y;
   	 }
   	 return gcd;
    }

}