#include <bits/stdc++.h>
using namespace std;
long long int extendedEuclid(long long int a, long long int b, long long int* x,
                             long long int* y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = extendedEuclid(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int main() {
  long long int A, B, C, x, y, ebob;
  cin >> A >> B >> C;
  ebob = extendedEuclid(A, B, &x, &y);
  if (C % ebob != 0)
    cout << -1 << endl;
  else {
    cout << -1 * x * C / ebob;
    cout << " ";
    cout << -1 * y * C / ebob;
    cout << endl;
  }
  return 0;
}

### Prompt

Please formulate a CPP solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int extendedEuclid(long long int a, long long int b, long long int* x,
                             long long int* y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = extendedEuclid(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int main() {
  long long int A, B, C, x, y, ebob;
  cin >> A >> B >> C;
  ebob = extendedEuclid(A, B, &x, &y);
  if (C % ebob != 0)
    cout << -1 << endl;
  else {
    cout << -1 * x * C / ebob;
    cout << " ";
    cout << -1 * y * C / ebob;
    cout << endl;
  }
  return 0;
}

```