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;
long long extendedEuclid(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long ret = extendedEuclid(b % a, a, x1, y1);
  x = y1 - b / a * x1;
  y = x1;
  return ret;
}
int32_t main() {
  long long a, b, x, y, c;
  cin >> a >> b >> c;
  long long xxx = extendedEuclid(a, b, x, y);
  c = c * (-1);
  if (c % xxx == 0) {
    cout << x * (c / xxx) << " " << y * (c / xxx) << "\n";
  } else
    cout << "-1"
         << "\n";
}