#include <bits/stdc++.h>
using namespace std;
void moveNext(long long &a, long long &b, long long q) {
  long long c = a - q * b;
  a = b;
  b = c;
}
long long c;
long long egcd(long long a, long long b, long long &x, long long &y) {
  long long x0, y0;
  x0 = y = 0;
  y0 = x = 1;
  while (b) {
    int q = a / b;
    moveNext(a, b, q);
    moveNext(x, x0, q);
    moveNext(y, y0, q);
  }
  return a;
}
int main() {
  long long a, b, x, y;
  cin >> a >> b >> c;
  long long ans = egcd(a, b, x, y);
  if (c % ans == 0)
    cout << x * (-c / ans) << ' ' << y * (-c / ans);
  else
    cout << -1;
}

### 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;
void moveNext(long long &a, long long &b, long long q) {
  long long c = a - q * b;
  a = b;
  b = c;
}
long long c;
long long egcd(long long a, long long b, long long &x, long long &y) {
  long long x0, y0;
  x0 = y = 0;
  y0 = x = 1;
  while (b) {
    int q = a / b;
    moveNext(a, b, q);
    moveNext(x, x0, q);
    moveNext(y, y0, q);
  }
  return a;
}
int main() {
  long long a, b, x, y;
  cin >> a >> b >> c;
  long long ans = egcd(a, b, x, y);
  if (c % ans == 0)
    cout << x * (-c / ans) << ' ' << y * (-c / ans);
  else
    cout << -1;
}

```