#include <bits/stdc++.h>
using namespace std;
long long iegcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long g = iegcd(b, a % b, x, y);
  long long z = x - y * (a / b);
  x = y;
  y = z;
  return g;
}
int main() {
  long long a, b, c, x, y;
  cin >> a >> b >> c;
  c *= -1;
  long long g = iegcd(a, b, x, y);
  if (abs(c) % g != 0)
    cout << -1 << endl;
  else {
    long long k = c / g;
    cout << k * x << " " << k * y << endl;
  }
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

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 iegcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long g = iegcd(b, a % b, x, y);
  long long z = x - y * (a / b);
  x = y;
  y = z;
  return g;
}
int main() {
  long long a, b, c, x, y;
  cin >> a >> b >> c;
  c *= -1;
  long long g = iegcd(a, b, x, y);
  if (abs(c) % g != 0)
    cout << -1 << endl;
  else {
    long long k = c / g;
    cout << k * x << " " << k * y << endl;
  }
}

```