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.*;

public class Line {
	public static void main(String[] args){
		Scanner reader = new Scanner(System.in);
		long a = reader.nextLong();
		long b = reader.nextLong();
		long c = -reader.nextLong();
		
		//long g = gcd(a,b);
		long[] r = eea(a,b);
		if(c%r[2] != 0)
			System.out.println("-1");
		else{
			//a/=g;
			//b/=g;
			//c/=g;
			
			//long[] r = eea(a,b);
			System.out.println(r[0]*c/r[2] + " " + r[1]*c/r[2]);
		}
	}
	
	public static long gcd(long a, long b){
		return b==0?a:gcd(b,a%b);
	}
	
	public static long[] eea(long a, long b){
		if(b==0)
			return new long[]{1,0,a};
		long q = a/b;
		long r = a%b;
		long[] rec = eea(b,r);
		return new long[]{rec[1],rec[0]-q*rec[1],rec[2]};
	}
}