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 C {
    static long x;
    static long y;

    public static long solve(long a, long b, long t1, long t2, long b1, long b2) {
        if (b == 0) {
            y = t1;
            x = -b1;
            return a;
        } else {
            long temp = t1;
            t1 = t2;
            t2 = a / b * t2 + temp;
            temp = b1;
            b1 = b2;
            b2 = a / b * b2 + temp;
            return solve(b, a % b, t1, t2, b1, b2);
        }
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long a = in.nextLong();
        long b = in.nextLong();
        long c = -in.nextLong();
        long gcd = solve(a, b, 0, 1, 1, 0);
        if (c % gcd != 0)
            System.out.println(-1);
        else {
            long sum = x * a + y * b;
            System.out.println((x * (c / sum)) + " " + (y * (c / sum)));
        }

    }
}