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:
//package com.company;
import java.io.*;

//@author Maurice Saldivar
//found equation online and translated it to code


public class Main {

    public static void main(String[] args) throws Exception{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pr = new PrintWriter(System.out);
        String tokens[];
        tokens = br.readLine().split("\\s+");
        int a = Integer.parseInt(tokens[0]);
        int b = Integer.parseInt(tokens[1]);
        int c = Integer.parseInt(tokens[2]);

        long r0 = a, r1 = b;
        long x0 = 1, x1 = 0;
        long y0 = 0, y1 = 1;
        long temp = 0;

        while (r1 != 0) {

            long q = r0 / r1;
            temp = r1;
            r1 = r0 - r1 * q;
            r0 = temp;
            temp = x1;
            x1 = x0 - x1 * q;
            x0 = temp;
            temp = y1;
            y1 = y0 - y1 * q;
            y0 = temp;
        }

        if (c % r0 != 0) {

            pr.println(-1);
        } else {

            long factor = -c / r0;
            pr.println(x0 * factor + " " + y0 * factor);
        }
        pr.flush();

    }
}