#include <bits/stdc++.h>
using namespace std;
long long a, b, c, t, tt, x, y;
void gcd(long long a, long long b) {
  if (b == 0) {
    x = 1;
    y = 0;
    return;
  }
  gcd(b, a % b);
  long long t = x;
  x = y;
  y = t - (a / b) * y;
}
int main() {
  cin >> a >> b >> c;
  gcd(a, b);
  t = a * x + b * y;
  if (c % t == 0) {
    tt = -c / t;
    x = x * tt;
    y = y * tt;
    cout << x << ' ' << y << endl;
  } else
    cout << -1 << endl;
}

### Prompt

Develop a solution in Cpp 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;
long long a, b, c, t, tt, x, y;
void gcd(long long a, long long b) {
  if (b == 0) {
    x = 1;
    y = 0;
    return;
  }
  gcd(b, a % b);
  long long t = x;
  x = y;
  y = t - (a / b) * y;
}
int main() {
  cin >> a >> b >> c;
  gcd(a, b);
  t = a * x + b * y;
  if (c % t == 0) {
    tt = -c / t;
    x = x * tt;
    y = y * tt;
    cout << x << ' ' << y << endl;
  } else
    cout << -1 << endl;
}

```