#include <bits/stdc++.h>
using namespace std;
void ex_gcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1;
    y = 0;
  } else {
    ex_gcd(b, a % b, y, x);
    y -= a / b * x;
  }
}
long long x, y;
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  c = -c;
  ex_gcd(a, b, x, y);
  long long gcd = a * x + b * y;
  if (c % gcd)
    cout << "-1";
  else
    cout << c / gcd * x << ' ' << c / gcd * y;
}

### Prompt

Create a solution in Cpp for 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;
void ex_gcd(long long a, long long b, long long &x, long long &y) {
  if (!b) {
    x = 1;
    y = 0;
  } else {
    ex_gcd(b, a % b, y, x);
    y -= a / b * x;
  }
}
long long x, y;
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  c = -c;
  ex_gcd(a, b, x, y);
  long long gcd = a * x + b * y;
  if (c % gcd)
    cout << "-1";
  else
    cout << c / gcd * x << ' ' << c / gcd * y;
}

```