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:
//package CF7C;

import java.util.Scanner;

public class Main {

	static long x , y;
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long A = sc.nextInt() , B = sc.nextInt() , C = sc.nextInt() , D = gcd((int)A,(int)B) , mult;
		//Ax+By=-c
		if(C%D!=0)
			System.out.println(-1);
		else {
			//Ax+By=1的解
			C=-C;
			exgcd((int)A,(int)B);
			x=C/D*x;y=C/D*y;
			System.out.println(x+" "+y);
		}
		

	}
	
	public static long gcd(long a, long b) {
		if(b==0)return a;
		return gcd(b,a%b);
	}
	
	public static void exgcd(int a , int b) {
		if(b==0) {
			x=1; y=0;
		}else {
			long p;
			exgcd(b,a%b);
			p=x;
			x=y;
			y=p-(a/b)*y;
		}
	}

}