#include <bits/stdc++.h>
using namespace std;
long long int exgcd(long long int a, long long int b, long long int &x,
                    long long int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int r = exgcd(b, a % b, x, y);
  int temp = y;
  y = x - (a / b) * y;
  x = temp;
  return r;
}
int main() {
  long long int A, B, C, k, x, y;
  cin >> A >> B >> C;
  k = exgcd(A, B, x, y);
  if (C % k != 0)
    cout << "-1" << endl;
  else {
    C = -C;
    cout << x * C / k << " " << y * C / k << endl;
  }
  return 0;
}

### Prompt

Generate 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 int exgcd(long long int a, long long int b, long long int &x,
                    long long int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int r = exgcd(b, a % b, x, y);
  int temp = y;
  y = x - (a / b) * y;
  x = temp;
  return r;
}
int main() {
  long long int A, B, C, k, x, y;
  cin >> A >> B >> C;
  k = exgcd(A, B, x, y);
  if (C % k != 0)
    cout << "-1" << endl;
  else {
    C = -C;
    cout << x * C / k << " " << y * C / k << endl;
  }
  return 0;
}

```