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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer(in.readLine());
        long a = Long.parseLong(st.nextToken());
        long b = Long.parseLong(st.nextToken());
        long c = Long.parseLong(st.nextToken());
        c *= -1;

        Point p = new Point();
        long nod = nod(a, b, p);

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

    static long nod(long a, long b, Point p)
    {

        if (a == 0)
        {
            return b;
        }
        
        Point pp = new Point();
        long g = nod(b % a, a, pp);
    
        p.x = pp.y - (b / a) * pp.x;
        p.y = pp.x;
    
        return g;
    }
}

class Point {
    long x;
    long y;

    Point() {
        x = 0;
        y = 1;
    }
}