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 LineP {
static long x = 0, y = 0, d = 0;
public static void gcd(long a, long b){  
    if(b == 0){
        d = a; 
        x = 1; 
        y = 0; 
    }  
    else {
        gcd(b, a % b); 
        long temp = 0;
        temp = x;
        x = y;
        y = temp;
        y -= x*(a / b); 
    }  
}  
 public static void main(String[] args){
     Scanner in = new Scanner(System.in);
     long a = in.nextLong();
     long b = in.nextLong();
     long c = in.nextLong();  
     long LL = 5 * (long)Math.pow(10, 18); 
     gcd(a,b);  
     if(c % d != 0 || -x * (c / d) > LL || -y * (c / d) > LL){  
        System.out.println(-1);  
        return;
     }
     else   
         System.out.println(-x * (c / d) + " " + -y * (c / d));  
 }
}