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

```