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

    private static long gcdEx(long a, long b) {
        if (b == 0) {
            x = 1;
            y = 0;
            return a;
        } else {
            long gcd = gcdEx(b, a % b);
            long t;
            t = x;
            x = y;
            y = t - (a / b) * y;
            return gcd;
        }
    }
}