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.Scanner;

public class Main
{
    static long x, y, a, b, c;

    static long exgcd(long a, long b)
    {
        if (b == 0)
        {
            x = 1;
            y = 0;
            return a;// 最小公约数
        }
        long g = exgcd(b, a % b);
        long t;
        t = x;
        x = y;
        y = t - (a / b) * y;
        return g;
    }
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        a = sc.nextLong();
        b = sc.nextLong();
        c = sc.nextLong();
        long t = exgcd(a, b);
        if (c % t == 0)// 点是否为整数
            System.out.println((-x * c / t) + " " + (-y * c / t));
        else
            System.out.println("-1");
        sc.close();
    }
}