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.math.BigInteger;
import java.util.*;

public class lol {
	
	static long gcd(long x, long y)
    {
        long r=0, a, b;
        a = (x > y) ? x : y; // a is greater number
        b = (x < y) ? x : y; // b is smaller number
 
        r = b;
        while(a % b != 0)
        {
            r = a % b;
            a = b;
            b = r;
        }
        return r;
    }
	
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		long a = in.nextInt();
		long b = in.nextInt();
		long c = in.nextInt();
		
		
		if(a==0)
		{
			if(b==0)
			{
				if(c!=0)
				{
					System.out.println("-1");
					return;
				}
				else
				{
					System.out.println("1 1");
					return;
				}
			}
			if(Math.abs(c)%Math.abs(b)!=0)
			{
				System.out.println("-1");
			}
			else
			{
				System.out.println(0+" "+(-c/b));
			}
			return;
		}
		else if(b==0)
		{
			if(c==0)
			{
				System.out.println("0 1");
				return;
			}
			else
			{
				if(Math.abs(c)%Math.abs(a)!=0)
				{
					System.out.println("-1");
				}
				else
				{
					System.out.println(0+" "+(-c/a));
				}
				return;
			}
		}
		else if(c==0)
		{
			System.out.println(b+" "+(-a));
			return;
		}
		long gcd = gcd(Math.abs(a),Math.abs(b));
		gcd=gcd(gcd,Math.abs(c));
		a/=gcd;
		b/=gcd;
		c/=gcd;
		
		if(gcd(Math.abs(b),Math.abs(a))!=1)
		{
			System.out.println("-1");
		}
		else
		{
			if(a<0)
			{
				a*=-1;
				b*=-1;
				c*=-1;
			}
			
			BigInteger j = new BigInteger(Long.toString(a));
			long temp=b;
			if(b<0)
			{
				long hl = b/a;
				b+=(hl+1)*a;
			}
			BigInteger m = new BigInteger(Long.toString(b));
			BigInteger k = m.modInverse(j);
			k=k.multiply(new BigInteger(Long.toString(-c)));
			k=k.mod(j);
			long ans = (-c-temp*(Integer.parseInt(k.toString())))/a;
			long y=1;
			for(int h=1;h<=18;h++)
				y*=10;
			y*=5;
			if(Math.abs(ans)>y)
			{
				System.out.println("-1");
			}
			else
				System.out.println(ans+" "+k.toString());
		}
	}
}