#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-7;
const long long MOD = 1000000007;
const long long INF = 1e9;
const long long MAXN = 100007;
int main() {
  ios_base::sync_with_stdio(0);
  long long a, b, c, k1 = 1, k2 = 0, k3 = 0, k4 = 1;
  cin >> a >> b >> c;
  while (a) {
    swap(k1, k3);
    k1 -= (b / a) * k3;
    swap(k2, k4);
    k2 -= (b / a) * k4;
    b %= a;
    swap(a, b);
  }
  if (c % b != 0) {
    cout << -1;
    return 0;
  }
  cout << -c / b * k3 << ' ' << -c / b * k4;
  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;
const double EPS = 1e-7;
const long long MOD = 1000000007;
const long long INF = 1e9;
const long long MAXN = 100007;
int main() {
  ios_base::sync_with_stdio(0);
  long long a, b, c, k1 = 1, k2 = 0, k3 = 0, k4 = 1;
  cin >> a >> b >> c;
  while (a) {
    swap(k1, k3);
    k1 -= (b / a) * k3;
    swap(k2, k4);
    k2 -= (b / a) * k4;
    b %= a;
    swap(a, b);
  }
  if (c % b != 0) {
    cout << -1;
    return 0;
  }
  cout << -c / b * k3 << ' ' << -c / b * k4;
  return 0;
}

```