#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T gcd(T a, T b) {
  if (b) return gcd(b, a % b);
  return a;
}
template <typename T>
inline T ext_gcd(T a, T b, T& x, T& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  T x1, y1;
  T g = ext_gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return g;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y;
  long long g = ext_gcd(a, b, x, y);
  long long change = (c % g != 0) ? -1 : -c / g;
  if (c % g)
    cout << -1 << '\n';
  else
    cout << x * change << " " << y * change << '\n';
}

### 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;
template <typename T>
inline T gcd(T a, T b) {
  if (b) return gcd(b, a % b);
  return a;
}
template <typename T>
inline T ext_gcd(T a, T b, T& x, T& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  T x1, y1;
  T g = ext_gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return g;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y;
  long long g = ext_gcd(a, b, x, y);
  long long change = (c % g != 0) ? -1 : -c / g;
  if (c % g)
    cout << -1 << '\n';
  else
    cout << x * change << " " << y * change << '\n';
}

```