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.*;
public final class Line {
    private static long[] gcd(long p, long q) {
        if (q == 0) return new long[] { p, 1, 0 };

        long[] v = gcd(q, p % q);
        long t = v[1];
        v[1] = v[2];
        v[2] = t - (p / q) * v[1];
        return v;
    }

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        long A = s.nextLong(), B = s.nextLong(), C = s.nextLong();
        long[] r = gcd(A, B);
        long k = (-1) * C / r[0];
        if (C % r[0] == 0) System.out.println(r[1] * k + " " + r[2] * k);
        else System.out.println(-1);
    }
}