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.io.*;
import java.util.*;
public class Main
{
	 static long x,y,gcd;
     public static void main(String[] args)
     {
    	 Scanner cin=new Scanner(new BufferedInputStream(System.in));
    	 while(cin.hasNextLong())
    	 {
    		 long a=cin.nextLong();
    		 long b=cin.nextLong();
    		 long c=cin.nextLong();
    		 gcd=extend_Euclid(a,b);
    		 if(c%gcd!=0)
    		 {
    			 System.out.println("-1");
    			 continue;
    		 }
    		 a/=gcd;
    		 b/=gcd;
    		 c/=gcd;
    		 c=-c;
    		 System.out.println(x*c+" "+y*c);
    	 }
     }
     public static long extend_Euclid(long a,long b)
     {
    	 if(b==0)
    	 {
    		 x=1;
    		 y=0;
    		 return a;
    	 }
    	 else
    	 {
    		 gcd=extend_Euclid(b,a%b);
    		 long temp=x;
    		 x=y;
    		 y=temp-a/b*y;
    	 }
    	 return gcd;
     }
}