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

### Prompt

In cpp, your task is to solve 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 x, y;
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1;
    y = 0;
    return a;
  } else {
    long long g = exgcd(b, a % b, x, y);
    long long t = x;
    x = y;
    y = t - a / b * y;
    return g;
  }
}
int main() {
  long long a, b, c, f1 = 1, f2 = 1;
  cin >> a >> b >> c;
  c = -c;
  if (c < 0) {
    c = -c;
    a = -a;
    b = -b;
  }
  if (a < 0) {
    a = -a;
    f1 = -f1;
  }
  if (b < 0) {
    b = -b;
    f2 = -f2;
  }
  long long g = exgcd(a, b, x, y);
  if (c % g) {
    cout << -1 << endl;
  } else {
    c /= g;
    cout << x * c * f1 << " " << y * c * f2 << endl;
  }
}

```