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 P7C {
    void line (){
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = -sc.nextLong();
        sc.close();

        long g = gcd(b, a);
        if (c % g != 0) {
            System.out.println("-1");
        }
        else {
            a /= g;
            b /= g;
            c /= g;
            long[] l = extendedGCD(a, b);
            System.out.println(l[0] * c + " " + l[1] * c);
        }
    }

    long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    long[] extendedGCD(long a, long b) {
        if (b == 0) {
            if (a < 0) {
                return new long[] {-1, 0};
            }
            else {
                return new long[] {1, 0};
            }
        }
        else {
            long q = a / b;
            long r = a - b * q;
            long[] st = extendedGCD(b, r);
            return new long[] {st[1], st[0] - q * st[1]};
        }
    }

    public static void main (String []args){
        P7C p = new P7C();
        p.line();
    }
}