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>
using namespace std;
int64_t gcd(int64_t a, int64_t b, int64_t &x, int64_t &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  int64_t x1, y1;
  int64_t d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
bool find_solve(int64_t a, int64_t b, int64_t c, int64_t &x0, int64_t &y0) {
  int64_t g;
  g = gcd(abs(a), abs(b), x0, y0);
  if (c % g) return false;
  x0 *= c / g;
  y0 *= c / g;
  x0 = (a < 0) ? -x0 : x0;
  y0 = (b < 0) ? -y0 : y0;
  return true;
}
int main() {
  int64_t a, b, c, x0, y0;
  cin >> a >> b >> c;
  if (find_solve(a, b, -c, x0, y0)) {
    cout << x0 << ' ' << y0;
  } else {
    cout << "-1";
  }
  return 0;
}