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 CPP):

Solution:
#include <bits/stdc++.h>
long long int kuozhan(long long int a, long long int b, long long int &x,
                      long long int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long int d = kuozhan(b, a % b, x, y);
  long long int temp = x;
  x = y;
  y = temp - (a / b) * y;
  return d;
}
int main() {
  long long int a, b, c, d, x, y;
  while (~scanf("%lld%lld%lld", &a, &b, &c)) {
    d = kuozhan(a, b, x, y);
    if (c % d != 0)
      printf("-1\n");
    else
      printf("%lld %lld\n", -x * (c / d), -y * (c / d));
  }
  return 0;
}