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 C7 {
    static long xg,yg;

    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 g = gcd(a, b);
        if (c % g != 0) {
            System.out.println(-1);
            return;
        }
        long x0 = xg * (c/g);
        long y0 = yg * (c/g);
        System.out.println(x0+" "+y0);
    }

    private static long gcd(long a, long b) {
        if (b==0) {
            xg = 1;
            yg = 0;
            return a;
        }
        long d = gcd(b, a % b);
        long temp = xg;
        xg = yg;
        yg = temp-a/b*yg;
        return d;
    }
}