#include <bits/stdc++.h>
const long long N = 1e6 + 10;
const long long mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f;
using namespace std;
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    long long g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long a, b, c, x, y, g;
  cin >> a >> b >> c;
  c = -c;
  g = exgcd(a, b, x, y);
  if (c % g)
    cout << "-1" << endl;
  else {
    x = x * c / g;
    y = y * c / g;
    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>
const long long N = 1e6 + 10;
const long long mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f;
using namespace std;
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    long long g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long a, b, c, x, y, g;
  cin >> a >> b >> c;
  c = -c;
  g = exgcd(a, b, x, y);
  if (c % g)
    cout << "-1" << endl;
  else {
    x = x * c / g;
    y = y * c / g;
    cout << x << " " << y << endl;
  }
  return 0;
}

```