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>
const int inf = 0x3f3f3f3f;
const double eps = 1e-6;
using namespace std;
long long gcd(long long a, long long b, long long& x, long long& y,
              long long c) {
  if (!a) {
    if (c % b) {
      puts("-1");
      exit(0);
    }
    x = 0;
    y = -c / b;
    return b;
  }
  long long x1, y1;
  long long r = gcd(b % a, a, x1, y1, c);
  x = y1 - (b / a) * x1;
  y = x1;
  return r;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y;
  long long d = gcd(a, b, x, y, c);
  assert(x >= -5000000000000000000LL && x <= 5000000000000000000LL);
  assert(y >= -5000000000000000000LL && y <= 5000000000000000000LL);
  cout << x << " " << y << endl;
  return 0;
}