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.math.BigInteger;
import java.io.*;

public class C {
    private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    public static void main (String[] args) throws IOException {
        String[] s = br.readLine().split(" ");
        BigInteger a = new BigInteger(s[0]);
        BigInteger b = new BigInteger(s[1]);
        BigInteger c = new BigInteger(s[2]);

        BigInteger g = a.gcd(b);
        if (!c.remainder(g).equals(BigInteger.ZERO)) {
            System.out.println(-1);
            return;
        }

        a = a.divide(g); b = b.divide(g); c = c.divide(g);

        if (a.equals(BigInteger.ZERO)) {
            if (c.remainder(b).equals(BigInteger.ZERO)) {
                System.out.println("0 " + c.divide(b).negate());
            } else {
                System.out.println(-1);
            }
            return;
        }
        if (b.equals(BigInteger.ZERO)) {
            if (c.remainder(a).equals(BigInteger.ZERO)) {
                System.out.println(c.divide(a).negate() + " 0");
            } else {
                System.out.println(-1);
            }
            return;
        }

        BigInteger x = a.modInverse(b.abs());
        BigInteger y = a.multiply(x).subtract(BigInteger.ONE).divide(b);
        System.out.println(x.multiply(c).negate() + " " + y.multiply(c));
        return;
    }
}