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;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
int n;
int m;
long long gcd(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long nx, ny;
  long long d = gcd(b % a, a, nx, ny);
  y = nx;
  x = -(b / a) * nx + ny;
  return d;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y;
  int qa = int(a < 0) - int(a > 0), qb = int(b < 0) - int(b > 0);
  long long d = gcd(abs(a), abs(b), x, y);
  if (abs(c) % d != 0)
    cout << "-1" << endl;
  else {
    c /= d;
    cout << x * qa * c << " " << y * qb * c << endl;
  }
  return 0;
}