#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:300000000")
using namespace std;
const double pi = 3.1415926535897932384626433832795;
template <class T>
T abs(const T &a) {
  return a >= 0 ? a : -a;
};
template <class T>
T sqr(const T &x) {
  return x * x;
}
long long a, b, c;
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    long long g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
  }
}
int main() {
  cin >> a >> b >> c;
  long long x, y;
  long long g = exgcd(a, b, x, y);
  if (c % g != 0)
    cout << -1;
  else
    cout << -x * c / g << ' ' << -y * c / g;
}

### Prompt

Construct a Cpp code solution to the problem outlined:

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>
#pragma comment(linker, "/STACK:300000000")
using namespace std;
const double pi = 3.1415926535897932384626433832795;
template <class T>
T abs(const T &a) {
  return a >= 0 ? a : -a;
};
template <class T>
T sqr(const T &x) {
  return x * x;
}
long long a, b, c;
long long exgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    long long g = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return g;
  }
}
int main() {
  cin >> a >> b >> c;
  long long x, y;
  long long g = exgcd(a, b, x, y);
  if (c % g != 0)
    cout << -1;
  else
    cout << -x * c / g << ' ' << -y * c / g;
}

```