#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
const double eps = 1e-9;
const double pi = acos(-1.0);
const long long inf = 1ll << 60;
const int mod = 1e9 + 7;
int gcd(int a, int b, long long& x, long long& y) {
  if (a == 0) {
    x = 0, y = 1;
    return b;
  }
  long long x1, y1;
  int d = gcd(b % a, a, x1, y1);
  x = y1 - b / a * x1, y = x1;
  return d;
}
int main() {
  int a, b, c;
  scanf("%d %d %d", &a, &b, &c);
  long long x, y;
  int d = gcd(a, b, x, y);
  if (c % d) {
    printf("-1\n");
    return 0;
  }
  cout << c / d * -x << " " << c / d * -y << endl;
  return 0;
}

### 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>
using namespace std;
template <class T>
T abs(T x) {
  return x > 0 ? x : -x;
}
const double eps = 1e-9;
const double pi = acos(-1.0);
const long long inf = 1ll << 60;
const int mod = 1e9 + 7;
int gcd(int a, int b, long long& x, long long& y) {
  if (a == 0) {
    x = 0, y = 1;
    return b;
  }
  long long x1, y1;
  int d = gcd(b % a, a, x1, y1);
  x = y1 - b / a * x1, y = x1;
  return d;
}
int main() {
  int a, b, c;
  scanf("%d %d %d", &a, &b, &c);
  long long x, y;
  int d = gcd(a, b, x, y);
  if (c % d) {
    printf("-1\n");
    return 0;
  }
  cout << c / d * -x << " " << c / d * -y << endl;
  return 0;
}

```