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

/**
 * @author def
 * @version 1.0
 */
public class C {

    public static void main(String[] args) throws IOException {
        new C().solve();
    }

    void solve() throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);

        final StringTokenizer st = new StringTokenizer(in.readLine());
        long a = Integer.parseInt(st.nextToken());
        long b = Integer.parseInt(st.nextToken());
        long c = -Integer.parseInt(st.nextToken());

        Point p = new Point();
        long d = egcd(a, b, p);

        if (c % d != 0) {
            out.println("-1");
        } else {
            a /= d;
            b /= d;
            c /= d;
            long x = p.x * c - b;
            long y = p.y * c + a;
            out.println(x + " " + y);
        }

        out.close();
    }

    long egcd(long a, long b, Point p) {
        if (a == 0) {
            p.x = 0;
            p.y = 1;
            return b;
        }
        Point p1 = new Point();
        long d = egcd(b % a, a, p1);
        p.x = p1.y - (b / a) * p1.x;
        p.y = p1.x;
        return d;
    }

    class Point {
        long x, y;
    }

    BufferedReader in;
    PrintWriter out;
}