#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll a, b, c, x, y;
ll exgcd(ll a, ll b) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  ll tmp = exgcd(b, a % b);
  ll t = x;
  x = y;
  y = t - a / b * y;
  return tmp;
}
int main() {
  cin >> a >> b >> c;
  c = -c;
  ll d = exgcd(a, b);
  if (c % d != 0) {
    cout << -1 << endl;
    return 0;
  }
  x = c / d * x;
  y = c / d * y;
  cout << x << " " << y << endl;
  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;
using ll = long long;
ll a, b, c, x, y;
ll exgcd(ll a, ll b) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  ll tmp = exgcd(b, a % b);
  ll t = x;
  x = y;
  y = t - a / b * y;
  return tmp;
}
int main() {
  cin >> a >> b >> c;
  c = -c;
  ll d = exgcd(a, b);
  if (c % d != 0) {
    cout << -1 << endl;
    return 0;
  }
  x = c / d * x;
  y = c / d * y;
  cout << x << " " << y << endl;
  return 0;
}

```