#include <bits/stdc++.h>
using namespace std;
long long a, b, c;
struct Tuple {
  long long x, y, gcd;
  Tuple(long long a, long long b, long long c) { x = a, y = b, gcd = c; }
};
Tuple extGcd(long long a, long long b) {
  if (b == 0) return Tuple(1, 0, a);
  Tuple ret = extGcd(b, a % b);
  return Tuple(ret.y, ret.x - a / b * ret.y, ret.gcd);
}
int main() {
  cin >> a >> b >> c;
  c = -c;
  Tuple t = extGcd(a, b);
  if (c % t.gcd == 0) {
    cout << t.x * (c / t.gcd) << " " << t.y * (c / t.gcd) << '\n';
  } else {
    cout << -1 << '\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;
long long a, b, c;
struct Tuple {
  long long x, y, gcd;
  Tuple(long long a, long long b, long long c) { x = a, y = b, gcd = c; }
};
Tuple extGcd(long long a, long long b) {
  if (b == 0) return Tuple(1, 0, a);
  Tuple ret = extGcd(b, a % b);
  return Tuple(ret.y, ret.x - a / b * ret.y, ret.gcd);
}
int main() {
  cin >> a >> b >> c;
  c = -c;
  Tuple t = extGcd(a, b);
  if (c % t.gcd == 0) {
    cout << t.x * (c / t.gcd) << " " << t.y * (c / t.gcd) << '\n';
  } else {
    cout << -1 << '\n';
  }
  return 0;
}

```