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.File;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class A {
    static long x,y;
    public static void main(String[] args) {
     Scanner sc = new Scanner(System.in);
     PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
     int a = sc.nextInt();
     int b = sc.nextInt();
     int c = sc.nextInt();
     if (a == 0 && b == 0 && c != 0){
         System.out.println(-1);
         return;
     }
     int g = gcd(a,b);
     if (c % g != 0){
         System.out.println(-1);
         return;
     }
     int l = gcd1(a,b);
     
     long x0 = -c * x / g;
     long y0 = -c * y / g;
     pw.print(x0+" "+y0);
     
     pw.close();
     
    }
    private static int gcd1(int a, int b) {
        if (b == 0){
            x = 1; y = 0;
            return a;
        }
        int d = gcd1(b,a % b);
        long t = x;
        x = y;
        y = t-(a/b)*y;
        return d;
    }

    private static int gcd(int a, int b) {
        return (b == 0)?a:gcd(b,a%b);
    }

}