#include <bits/stdc++.h>
using namespace std;
long long a, b, c;
void move1step(int& a, int& b, const int& q) {
  int c = a - q * b;
  a = b;
  b = c;
}
int eGCD(int r0, int r1, int& x0, int& y0) {
  int x1 = y0 = 0, y1 = x0 = 1;
  while (r1) {
    int q = r0 / r1;
    move1step(r0, r1, q);
    move1step(x0, x1, q);
    move1step(y0, y1, q);
  }
  return r0;
}
int main() {
  int X, Y;
  cin >> a >> b >> c;
  int mgcd = eGCD(a, b, X, Y);
  if (-c % mgcd == 0) {
    cout << X * ((c * -1) / mgcd) << ' ' << Y * ((c * -1) / mgcd) << endl;
  } else {
    cout << -1;
  }
  return 0;
}

### Prompt

Please formulate a CPP solution to 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 a, b, c;
void move1step(int& a, int& b, const int& q) {
  int c = a - q * b;
  a = b;
  b = c;
}
int eGCD(int r0, int r1, int& x0, int& y0) {
  int x1 = y0 = 0, y1 = x0 = 1;
  while (r1) {
    int q = r0 / r1;
    move1step(r0, r1, q);
    move1step(x0, x1, q);
    move1step(y0, y1, q);
  }
  return r0;
}
int main() {
  int X, Y;
  cin >> a >> b >> c;
  int mgcd = eGCD(a, b, X, Y);
  if (-c % mgcd == 0) {
    cout << X * ((c * -1) / mgcd) << ' ' << Y * ((c * -1) / mgcd) << endl;
  } else {
    cout << -1;
  }
  return 0;
}

```