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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author duc
 */
public class Main {

    static long[] extendedEuclid(long a, long b) {
        long ret[] = new long[2];
        if (b == 0) {
            ret[0] = 1;
            ret[1] = 0;
            return ret;
        }
        long ret2[];
        ret2 = extendedEuclid(b, a % b);
        ret[0] = ret2[1];
        ret[1] = ret2[0] - (a / b) * ret2[1];
        return ret;
    }

    public static void main(String args[]) throws FileNotFoundException {
        //Scanner in = new Scanner(new File("d:/in.txt"));

        Scanner in = new Scanner(System.in);

        long a = in.nextLong();
        long b = in.nextLong();
        long c = in.nextLong();

        long e[] = extendedEuclid(a, b);
        long x = e[0];
        long y = e[1];
        long d = a*x+b*y;

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