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.*;
public class Line {
    
    static long[] solution(long a, long b){
        if(a==0) return new long[]{0,1,b};
        long[] ans = solution(b%a,a);
        return new long[]{ans[1]-(b/a)*ans[0],ans[0],ans[2]};
    }
    
    static void solve(){
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long[] ans = solution(a,b);
        long C = -c/ans[2];
        if((c%ans[2])==0) System.out.println((C*ans[0])+" "+(C*ans[1]));
        else System.out.println(-1);
    }
    
    public static void main(String args[]) {
        solve();
    }
}