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

### Prompt

In cpp, your task is to solve 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 exgcd(long long a, long long b, long long& d, long long& x, long long& y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    exgcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
int main() {
  long long a, b, c, d, x, y;
  cin >> a >> b >> c;
  exgcd(a, b, d, x, y);
  if ((c % d) != 0)
    puts("-1");
  else
    cout << x * (-c / d) << " " << y * (-c / d) << endl;
  return 0;
}

```