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.Scanner;

public class Problem_7C {
  private static long[] extendedGCD(long a, long b) {
    long[][] res = new long[][] { {1, 0, a}, {0, 1, b}, {0, 0, 0}};
    while (res[1][2] != 0) {
      long q = res[0][2] / res[1][2];
      for (int i = 0; i < 3; i++) {
        res[2][i] = res[0][i] - res[1][i] * q;
      }
      res[0] = res[1];
      res[1] = res[2];
      res[2] = new long[3];
    }
    return res[0];
  }

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    long a = sc.nextLong();
    long b = sc.nextLong();
    long c = sc.nextLong();
    long[] ans = extendedGCD(a, b);
    if (c % ans[2] == 0) {
      System.out.println((ans[0] * (-c / ans[2])) + " " + (ans[1] * (-c / ans[2])));
    } else {
      System.out.println(-1);
    }
    sc.close();
  }
}