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() {
  long long int a, b, c;
  cin >> a >> b >> c;
  long long int x, yAnt, r, aIni, bIni, sr, q;
  aIni = a;
  bIni = b;
  x = 1;
  yAnt = 0;
  if (c != 0) {
    while (b != 0) {
      r = a % b;
      q = a / b;
      a = b;
      b = r;
      sr = x - yAnt * q;
      x = yAnt;
      yAnt = sr;
    }
    int mcd = a;
    if (c % mcd != 0) {
      cout << -1;
    } else {
      cout << (-x * (c / mcd)) << " ";
      cout << (((a - x * aIni) / bIni) * (-c / mcd));
    }
  } else {
    cout << "0"
         << " 0";
  }
}