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 Open {

    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 = gcd(A, B);
        if (C % gcd != 0) {
            System.out.println("-1");
        } else {
            extendGCD(A, B);
            System.out.println(x * (C / gcd) + " " + y * (C / gcd));
        }
    }

    public static long gcd(long a, long b) {
        while (b != 0) {
            long c = a % b;
            a = b;
            b = c;
        }
        return a;
    }
    
    static long d, x, y;

    static void extendGCD(long A, long B) {
        if (B == 0) {
            d = A;
            x = 1;
            y = 0;
        } else {
            extendGCD(B, A % B);
            long temp = x;
            x = y;
            y = temp - (A / B) * y;
        }
    }
}