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;
void move1step(long long& a, long long& b, long long q) {
  long long c = a - q * b;
  a = b;
  b = c;
}
long long egcd(long long r0, long long r1, long long& x0, long long& y0) {
  long long x1 = 0, y1 = 1;
  x0 = 1;
  y0 = 0;
  while (r1) {
    long long q = r0 / r1;
    move1step(r0, r1, q);
    move1step(x0, x1, q);
    move1step(y0, y1, q);
  }
  return r0;
}
bool solve(long long a, long long b, long long c, long long& x, long long& y) {
  long long g = egcd(a, b, x, y);
  int m = c / g;
  x *= m;
  y *= m;
  return c % g == 0;
}
int main() {
  long long a, b, c, x, y;
  cin >> a >> b >> c;
  if (solve(a, b, -1 * c, x, y))
    cout << x << " " << y;
  else
    cout << -1;
  return 0;
}