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.Arrays;
import java.util.Scanner;

/**
 * Created by vstepanov on 03.07.2017.
 */
public class Main {
    public static void main(String[] args) {
        try(Scanner in = new Scanner(System.in)) {
            long A = in.nextInt();
            long B = in.nextInt();
            long C = -in.nextInt();
            long[] xy = new long[]{0, 0};
            long g = gcd(Math.abs(A), Math.abs(B), xy);
            if (C % g != 0) {
                System.out.println("-1");
                return;
            }
            long x0 = xy[0] * C/g;
            long y0 = xy[1] * C/g;
            if (A < 0) x0 *= -1;
            if (B < 0) y0 *= -1;
            System.out.println(x0 + " " + y0);
        }
    }
    // a * x1 + b * y1 = d
    private static long gcd(long a, long b, long[] xy) {
        if (a == 0) {
            xy[0] = 0; xy[1] = 1;
            return b;
        }
        long[] xy1 = new long[]{0,0};
        long d = gcd(b%a, a, xy1);
        xy[0] = xy1[1] - (b/a) * xy1[0];
        xy[1] = xy1[0];
        return d;
    }
}