#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
ll egcd(ll a, ll b, ll &x, ll &y) {
  ll d;
  if (!b) {
    x = 1LL;
    y = 0LL;
    return a;
  } else {
    d = egcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
  }
}
int main() {
  ll a, b, c, x, y, gcd;
  while (cin >> a >> b >> c) {
    gcd = egcd(a, b, x, y);
    if (c % gcd) {
      puts("-1");
    } else {
      cout << ((x * -c) / gcd) << " " << ((y * -c) / gcd) << "\n";
    }
  }
  return 0;
}

### 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;
using ll = long long int;
ll egcd(ll a, ll b, ll &x, ll &y) {
  ll d;
  if (!b) {
    x = 1LL;
    y = 0LL;
    return a;
  } else {
    d = egcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
  }
}
int main() {
  ll a, b, c, x, y, gcd;
  while (cin >> a >> b >> c) {
    gcd = egcd(a, b, x, y);
    if (c % gcd) {
      puts("-1");
    } else {
      cout << ((x * -c) / gcd) << " " << ((y * -c) / gcd) << "\n";
    }
  }
  return 0;
}

```