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 gcdext(long long a, long long b, long long& x, long long& y) {
  long long r2, x2, y2, r1, x1, y1, r0, x0, y0, q;
  r2 = a, x2 = 1, y2 = 0;
  r1 = b, x1 = 0, y1 = 1;
  while (r1) {
    q = r2 / r1;
    r0 = r2 % r1;
    x0 = x2 - q * x1;
    y0 = y2 - q * y1;
    r2 = r1, x2 = x1, y2 = y1;
    r1 = r0, x1 = x0, y1 = y0;
  }
  long long g = r2;
  x = x2, y = y2;
  if (g < 0) g = -g, x = -x, y = -y;
  return g;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  if (a == 0) {
    if (c % b != 0) {
      cout << "-1\n";
      return 0;
    }
    cout << "0 " << -c / b << '\n';
    return 0;
  }
  if (b == 0) {
    if (c % a != 0) {
      cout << "-1\n";
      return 0;
    }
    cout << -c / a << " 0\n";
    return 0;
  }
  if (c == 0) {
    cout << b << " " << -a << '\n';
    return 0;
  }
  long long X, Y;
  long long g1 = gcdext(a, b, X, Y);
  if (c % g1 != 0) {
    cout << "-1\n";
    return 0;
  }
  X *= -c / g1;
  Y *= -c / g1;
  cout << X << " " << Y << '\n';
}