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;
int main() {
  int a, b, c;
  cin >> a >> b >> c;
  int asign = 1, bsign = 1, swapped = 0;
  if (a < 0 && b < 0) {
    a = -a;
    b = -b;
    c = -c;
  } else if (a < 0 && b >= 0) {
    a = -a;
    asign = -1;
  } else if (b < 0 && a >= 0) {
    b = -b;
    bsign = -1;
  }
  if (a > b) {
    swap(a, b);
    swapped = 1;
  }
  stack<int> s;
  while (a > 0) {
    s.push(-(b / a));
    int tmp = a;
    a = b - (b / a) * a;
    b = tmp;
  }
  if (c % b == 0) {
    long long int x1 = 0, y1 = 1;
    long long int x2, y2;
    while (!s.empty()) {
      int r = s.top();
      s.pop();
      x2 = r * x1 + y1;
      y2 = x1;
      swap(x1, x2);
      swap(y1, y2);
    }
    if (swapped) swap(x1, y1);
    x1 *= asign;
    y1 *= bsign;
    cout << -c / b * x1 << " " << -c / b * y1 << endl;
  } else {
    cout << -1 << endl;
  }
  return 0;
}