#include <bits/stdc++.h>
using namespace std;
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  if (b == 0) {
    if (c % a == 0)
      cout << -(c / a) << " 0"
           << "\n";
    else
      cout << -1 << "\n";
    return 0;
  }
  long long r0 = a, r1 = b, x0 = 1, x1 = 0, y0 = 0, y1 = 1;
  while (r0 % r1) {
    long long r = r0 % r1;
    long long x = x0 - r0 / r1 * x1;
    long long y = y0 - r0 / r1 * y1;
    r0 = r1, r1 = r;
    x0 = x1, x1 = x;
    y0 = y1, y1 = y;
  }
  if (c % r1) {
    cout << -1 << "\n";
    return 0;
  }
  long long factor = -(c / r1);
  cout << factor * x1 << " " << factor * y1 << "\n";
  return 0;
}

### Prompt

Please create a solution in cpp 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;
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  if (b == 0) {
    if (c % a == 0)
      cout << -(c / a) << " 0"
           << "\n";
    else
      cout << -1 << "\n";
    return 0;
  }
  long long r0 = a, r1 = b, x0 = 1, x1 = 0, y0 = 0, y1 = 1;
  while (r0 % r1) {
    long long r = r0 % r1;
    long long x = x0 - r0 / r1 * x1;
    long long y = y0 - r0 / r1 * y1;
    r0 = r1, r1 = r;
    x0 = x1, x1 = x;
    y0 = y1, y1 = y;
  }
  if (c % r1) {
    cout << -1 << "\n";
    return 0;
  }
  long long factor = -(c / r1);
  cout << factor * x1 << " " << factor * y1 << "\n";
  return 0;
}

```