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.*;
import java.util.*;
import static java.lang.Math.*;

public class Main {
    public static void main(String[] args) throws IOException {
        new Main().run();
    }

    BufferedReader in;
    PrintWriter out;
    StringTokenizer st = new StringTokenizer("");
    
    long x = 0;
    long y = 0;
    
    void run() throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        
        long A = nextLong();
        long B = nextLong();
        long C = -nextLong();
        
        if (C < 0) {
            A = -A;
            B = -B;
            C = -C;
        }
        
        long signA = Long.signum(A);
        long signB = Long.signum(B);
        
        A = abs(A);
        B = abs(B);
        
        long gcd = egcd(A, B);
        
        if (C % gcd != 0) {
            out.println(-1);
            out.close();
            return;
        }
        
        x = x * (C / gcd) * signA;
        y = y * (C / gcd) * signB;
        out.println(x + " " + y);
        out.close();
    }
    
    long egcd(long a, long b) {
        x = 0;
        y = 1;
        long px = 1;
        long py = 0;
        
        while (b != 0) {
            long q = a / b;
            long t = a % b;
            a = b;
            b = t;
            
            t = x;
            x = px - q * x;
            px = t;
            
            t = y;
            y = py - q * y;
            py = t;
        }
        
        x = px;
        y = py;
        return a;
    }
    
    String nextToken() throws IOException {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        
        return st.nextToken();
    }
    
    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    
    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
}