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.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;

public class _{
    Scanner sc=new Scanner(System.in);

    int INF=1<<28;
    double EPS=1e-9;

    int a, b, c;

    void run(){
        a=sc.nextInt();
        b=sc.nextInt();
        c=sc.nextInt();
        solve();
    }

    void solve(){
        int[] is=extgcd(abs(a), abs(b));
        is[0]*=Integer.signum(a);
        is[1]*=Integer.signum(b);
        // debug(is, is[0]*a+is[1]*b);
        if(abs(c)%is[2]!=0){
            println("-1");
        }else{
            long x=(long)is[0]*(-c/is[2]);
            long y=(long)is[1]*(-c/is[2]);
            println(x+" "+y);
        }
    }

    int[] extgcd(int a, int b){
        int x=1, y=0, gcd=a;
        if(b!=0){
            int[] is=extgcd(b, a%b);
            x=is[1];
            y=is[0];
            gcd=is[2];
            y-=a/b*x;
        }
        return new int[]{x, y, gcd};
    }

    void println(String s){
        System.out.println(s);
    }

    void print(String s){
        System.out.print(s);
    }

    void debug(Object... os){
        System.err.println(Arrays.deepToString(os));
    }

    public static void main(String[] args){
        new _().run();
    }
}