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

import java.util.LinkedList;
import java.util.Scanner;
@SuppressWarnings("unused")
public class round7C {
     static LinkedList<Long> stack;
     static long A, B, gcd;
     public static long gcd(long a, long b) {
             if (b < a)
                     return gcd(b, a);
             if (a == 0)
                     return b;
             if (b % a == 0) {
                     stack.addFirst(-1 * (b / a - 1));
             } else {
                     stack.addFirst(-1 * (b / a));
             }
             return gcd(b % a, a);
     }
     public static long[] generate() {
             long f = 1, sec = stack.remove();
             int turn = 0;
             while (!stack.isEmpty()) {
                     long rem = stack.remove();
                     if (turn == 0) {
                             f += (sec * rem);
                     } else {
                             sec += (f * rem);
                     }
                     turn = 2 - turn;
             }
             if (f * Math.abs(A) + sec * Math.abs(B) == gcd)
                     return new long[] { f, sec };
             return new long[] { sec, f };
     }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        A = sc.nextLong();
        B = sc.nextLong();
        long C = sc.nextLong() * -1;
        stack = new LinkedList<Long>();
        if(A == 0){
            if(C % B == 0){
                System.out.println(1 + " " + (C / B));
            }else
                System.out.println(-1);
            return;
        }
        if(B == 0){
            if(C % A == 0){
                System.out.println((C / A) + " " + 1);
            }else
                System.out.println(-1);
            return;
        }
        gcd = gcd(abs(A), abs(B));
        if(C % gcd != 0){
            System.out.println(-1);
            return;
        }
        long toMultiply = C / gcd;
        long [] ans = generate();
        if(A < 0)
            ans[0] *= -1;
        if(B < 0)
            ans[1] *= -1;
        System.out.println((ans[0] * toMultiply)+ " " + (ans[1] * toMultiply));
        
    }
}