#include <bits/stdc++.h>
using namespace std;
int64_t exgcd(int64_t a, int64_t b, int64_t& x, int64_t& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int64_t G = exgcd(b, a % b, y, x);
  y -= (a / b) * x;
  return G;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int64_t A, B, C;
  cin >> A >> B >> C;
  int64_t x, y;
  int64_t G = exgcd(A, B, x, y);
  if (C * x % G || C * y % G)
    cout << "-1";
  else
    cout << -C * x / G << ' ' << -C * y / G << '\n';
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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;
int64_t exgcd(int64_t a, int64_t b, int64_t& x, int64_t& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int64_t G = exgcd(b, a % b, y, x);
  y -= (a / b) * x;
  return G;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int64_t A, B, C;
  cin >> A >> B >> C;
  int64_t x, y;
  int64_t G = exgcd(A, B, x, y);
  if (C * x % G || C * y % G)
    cout << "-1";
  else
    cout << -C * x / G << ' ' << -C * y / G << '\n';
  return 0;
}

```