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 C
{
   public static void main(String[] args)
   {
      new C(new Scanner(System.in));
   }

   long gcd(long a, long b){
      return b==0 ? a : gcd(b, a%b);
   }

   long[] extgcd(long a, long b)
   {
      if (a == 0)
         return new long[]{0,1};
      long r = b%a;
      long t = b/a;
      long[] u = extgcd(r,a);
      return new long[]{u[1] - u[0]*t, u[0]};
   }

   public C(Scanner in)
   {
      long A = in.nextLong();
      long B = in.nextLong();
      long C = in.nextLong();

      long g = gcd(Math.abs(A), Math.abs(B));
      if (C%g != 0)
      {
         System.out.println("-1");
         return;
      }

      long[] r = extgcd(Math.abs(A), Math.abs(B));
      r[0] = (r[0] * C) / g;
      r[1] = (r[1] * C) / g;
      for (int i=-1; i<2; i+=2)
      {
         for (int j=-1; j<2; j+=2)
         {
            long x = r[0]*i;
            long y = r[1]*j;
            long CV = A*x+B*y+C;
            if (CV == 0)
            {
               System.out.printf("%d %d%n", x, y);
               return;
            }
         }
      }
      System.out.println("BADNESS");
   }
}