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

### 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;
long long gcd(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
int main() {
  long long a, b, c;
  cin >> a >> b >> c;
  long long x, y;
  c = -c;
  long long gg = gcd(a, b, x, y);
  if (c % gg != 0) {
    cout << -1 << endl;
    return 0;
  }
  cout << x * (c / gg) << " " << y * (c / gg) << endl;
  return 0;
}

```