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 Problem0007c {
    static long x = 0;
    static long y = 0;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong() * -1;
        long gcd = gcd(a, b);
        if(c % gcd != 0) {
            System.out.println("-1");
            return;
        }
        long xval = c / gcd * x;
        long yval = c / gcd * y;
        System.out.println(xval+" "+yval);
    }
    public static long gcd(long a, long b) {
        if(b == 0) {
            x = 1;
            y = 0;
            return a;
        }
        long temp = gcd(b, a%b);
        long t = x;
        x = y;
        y = t - a / b * y;
        return temp;
    }
}