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 Main {
	
	
	public static Triplet gcd1(long a,long b) {
		
		if(b==0) {
			
			Triplet op=new Triplet();
			op.gcd=a;
			op.x=1;
			op.y=0;
			return op;
		}
		
		Triplet smallans=gcd1(b,a%b);
		Triplet myans=new Triplet();
		myans.gcd=smallans.gcd;
		myans.x=smallans.y;
		myans.y=smallans.x-(a/b)*smallans.y;
		return myans;
	}

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		long a=sc.nextLong();
		long b=sc.nextLong();
		long c=sc.nextLong();
		
		Triplet d=gcd1(a,b);
		if(c%d.gcd!=0) {
			System.out.println(-1);
		}
		else {
			
			long ans1=d.x * (-c)/d.gcd;
			long ans2=d.y * (-c)/d.gcd;
			System.out.println(ans1+" "+ans2);
		}
	}
	
	public static long gcd(long a,long b) {
		
		if(b==0) {
			return a;
		}
		else {
			return gcd(b,a%b);
		}
	}
}
class Triplet{
	
	long gcd;
	long x;
	long y;
	
	// ax+by=gcd(a,b)
}