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 C7 {
    
    class Triple {
        public final long g, x, y;
        public Triple(long g0, long x0, long y0) {
            g = g0;
            x = x0;
            y = y0;
        }
    }
    
    public Triple gcdex(long a, long b) {
        if (a == 0) {
            return new Triple(b, 0L, 1L);
        }
        Triple r = gcdex(b % a, a);
        return new Triple(r.g, r.y - (b/a)*r.x, r.x);
    }
    
    public void solve() {
        long a, b, c, m;
        Scanner in = new Scanner(System.in);
        a = in.nextLong();
        b = in.nextLong();
        c = -in.nextLong();
        m = gcdex(a, b).g;
        if (c % m != 0) {
            System.out.println("-1");
            return;
        }
        a /= m;
        b /= m;
        c /= m;
        Triple r = gcdex(a, b);
        System.out.printf("%d %d\n", c*r.x, c*r.y);
    }
    public static void main(String[] args) {
        new C7().solve();
    }

}