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.Scanner;
public class line {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		long a = sc.nextLong();
		long b = sc.nextLong();
		long c = sc.nextLong();
		long h = gcd1(a,b);
		if(-c%h!=0) {
			System.out.println(-1);
		}
		else {
			long g = -c/h;
			triple finale = gcd(a,b);
			System.out.println(finale.x*g+" "+finale.y*g);
		}
	}
	public static triple gcd(long a, long b) {
		triple ans = new triple();
		triple sans = new triple();
		if(b==0) {
			ans.x=1;
			ans.y=0;
			ans.gcd=a;
			return ans;
		}
		sans = gcd(b,a%b);
		ans.x = sans.y;
		ans.y = sans.x-(a/b)*sans.y;
		ans.gcd=sans.gcd;
		return ans;
	}
	public static long gcd1(long a, long b) {
		if(b==0) {
			return a;
		}
		return gcd1(b,a%b);
	}

}
class triple{
	long x;
	long y;
	long gcd;
}