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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Line {
    public static long[] find_extended_GCD(long a, long b) {
        if (a == 0) {
            return new long[]{0, 1, b};
        }

        long[] gcdResult = find_extended_GCD(b % a, a);

        long x = gcdResult[1] - (b / a) * gcdResult[0];
        long y = gcdResult[0];
        return new long[]{x, y, gcdResult[2]};
    }

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        String[] temp = in.readLine().split(" ");
        long A = Long.parseLong(temp[0]);
        long B = Long.parseLong(temp[1]);
        long C = Long.parseLong(temp[2]) * -1;

        long[] gcdResult = find_extended_GCD(A, B);

        if (C % gcdResult[2] == 0) {
            long multiple = C / gcdResult[2];
            System.out.println(gcdResult[0] * multiple + " " + gcdResult[1] * multiple);
        } else {
            System.out.println(-1);
        }
    }
}