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.*;
public class Solution
{
    static long gcd;
    static long x,y;
    public static void main(String ag[])
    {
        Scanner sc=new Scanner(System.in);
        
        long A=sc.nextLong();
        long B=sc.nextLong();
        long C=sc.nextLong();
        gcd(A,B);
        if(C%gcd!=0)
        System.out.println(-1);
        else 
        {
            C*=-1;
            x*=C/gcd;
            y*=C/gcd;
            System.out.println(x+" "+y);
        }
        
    }
    public static void gcd(long A,long B)
    {
        if(B==0)
        {
            x=1;
            y=0;
            gcd=A;
        }
        else 
        {
            gcd(B,A%B);
            long temp=x;
            x=y;
            y=temp-(A/B)*y;
        }
    }
}