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 ExtendedEculid(long long iNum1, long long iNum2, long long &iAnsX,
                         long long &iAnsY) {
  if (iNum2 == 0) {
    iAnsX = 1;
    iAnsY = 0;
    return iNum1;
  }
  long long ret;
  ret = ExtendedEculid(iNum2, iNum1 % iNum2, iAnsX, iAnsY);
  long long iTmp = iAnsX;
  iAnsX = iAnsY;
  iAnsY = iTmp - (iNum1 / iNum2) * iAnsY;
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  long long iX, iY;
  long long A, B, C, iGCD;
  cin >> A >> B >> C;
  iGCD = ExtendedEculid(A, B, iX, iY);
  if (C % iGCD) {
    cout << -1;
    goto endapp;
  }
  iX *= -C / iGCD;
  iY *= -C / iGCD;
  if (iX <= 5e18 && iX >= -5e18 && iY <= 5e18 && iY >= -5e18)
    cout << iX << ' ' << iY;
  else
    cout << -1;
endapp:
  return 0;
}