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 Main {

  public static void main(String args[]) {
    (new Main()).solve();
  }

  void solve() {

    Scanner cin = new Scanner(System.in);

    long a = cin.nextLong();
    long b = cin.nextLong();
    long c = cin.nextLong();

    long mat[][] = new long[][] { { a, 1, 0 }, { b, 0, 1 } };
    if( mat[0][0] < 0 ) {
      mat[0][0] = -a;
      mat[0][1] = -1;
    }
    if( mat[1][0] < 0 ) {
      mat[1][0] = -b;
      mat[1][2] = -1;
    }

    while( mat[0][0] != 0 ) {
      long v = mat[1][0] / mat[0][0];
      long next[] = new long[3];
      for(int i=0; i<3; ++i) {
        next[i] = mat[1][i] - mat[0][i] * v;
        mat[1][i] = mat[0][i];
        mat[0][i] = next[i];
      }
    }

    if( c % mat[1][0] != 0 ) {
      System.out.println(-1);
    }
    else {
      long d = -c / mat[1][0];
      System.out.println((mat[1][1] * d) + " " + (mat[1][2] * d));
    }

  }

}