#include <bits/stdc++.h>
using namespace std;
bool chk(long long x1, long long y1) {
  return fabs(x1 * 1.0) <= 5000000000000000000ll &&
         fabs(y1) <= 5000000000000000000ll;
}
long long u, v;
long long gcd(long long a, long long b) {
  if (a == 0) {
    v = 1;
    u = 0;
    return b;
  }
  long long d = gcd(b % a, a), u1 = u, v1 = v;
  u = v1 - b / a * u1;
  v = u1;
  return d;
}
int main() {
  long long a, b, c, g;
  cin >> a >> b >> c;
  g = gcd(a, b);
  if (c % g == 0 && chk(c * u, c * v))
    cout << -c / g * u << " " << -c / g * v;
  else
    cout << -1;
  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;
bool chk(long long x1, long long y1) {
  return fabs(x1 * 1.0) <= 5000000000000000000ll &&
         fabs(y1) <= 5000000000000000000ll;
}
long long u, v;
long long gcd(long long a, long long b) {
  if (a == 0) {
    v = 1;
    u = 0;
    return b;
  }
  long long d = gcd(b % a, a), u1 = u, v1 = v;
  u = v1 - b / a * u1;
  v = u1;
  return d;
}
int main() {
  long long a, b, c, g;
  cin >> a >> b >> c;
  g = gcd(a, b);
  if (c % g == 0 && chk(c * u, c * v))
    cout << -c / g * u << " " << -c / g * v;
  else
    cout << -1;
  return 0;
}

```